./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/pcompf.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/array-fpi/pcompf.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f995d1a14a0e61f10b2f5817b1ff2bf8d1511dbe7297ad48450a11ed6f3a9160 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:11:41,075 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:11:41,077 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:11:41,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:11:41,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:11:41,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:11:41,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:11:41,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:11:41,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:11:41,127 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:11:41,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:11:41,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:11:41,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:11:41,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:11:41,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:11:41,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:11:41,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:11:41,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:11:41,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:11:41,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:11:41,141 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:11:41,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:11:41,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:11:41,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:11:41,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:11:41,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:11:41,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:11:41,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:11:41,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:11:41,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:11:41,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:11:41,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:11:41,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:11:41,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:11:41,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:11:41,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:11:41,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:11:41,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:11:41,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:11:41,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:11:41,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:11:41,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:11:41,154 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:11:41,174 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:11:41,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:11:41,174 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:11:41,175 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:11:41,175 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:11:41,175 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:11:41,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:11:41,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:11:41,176 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:11:41,176 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:11:41,177 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:11:41,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:11:41,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:11:41,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:11:41,177 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:11:41,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:11:41,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:11:41,178 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:11:41,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:11:41,178 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:11:41,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:11:41,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:11:41,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:11:41,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:11:41,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:11:41,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:11:41,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:11:41,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:11:41,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:11:41,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:11:41,179 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:11:41,180 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:11:41,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:11:41,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f995d1a14a0e61f10b2f5817b1ff2bf8d1511dbe7297ad48450a11ed6f3a9160 [2022-07-13 11:11:41,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:11:41,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:11:41,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:11:41,396 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:11:41,396 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:11:41,397 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/pcompf.c [2022-07-13 11:11:41,446 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a2f6699/af6b0ae693a4455cb02b6e42759442bc/FLAG1da31cfb6 [2022-07-13 11:11:41,768 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:11:41,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/pcompf.c [2022-07-13 11:11:41,773 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a2f6699/af6b0ae693a4455cb02b6e42759442bc/FLAG1da31cfb6 [2022-07-13 11:11:42,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a2f6699/af6b0ae693a4455cb02b6e42759442bc [2022-07-13 11:11:42,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:11:42,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:11:42,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:11:42,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:11:42,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:11:42,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:11:42" (1/1) ... [2022-07-13 11:11:42,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b03cd33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:11:42, skipping insertion in model container [2022-07-13 11:11:42,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:11:42" (1/1) ... [2022-07-13 11:11:42,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:11:42,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:11:42,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/pcompf.c[589,602] [2022-07-13 11:11:42,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:11:42,368 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:11:42,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/pcompf.c[589,602] [2022-07-13 11:11:42,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:11:42,409 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:11:42,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:11:42 WrapperNode [2022-07-13 11:11:42,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:11:42,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:11:42,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:11:42,411 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:11:42,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:11:42" (1/1) ... [2022-07-13 11:11:42,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:11:42" (1/1) ... [2022-07-13 11:11:42,446 INFO L137 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-07-13 11:11:42,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:11:42,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:11:42,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:11:42,447 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:11:42,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:11:42" (1/1) ... [2022-07-13 11:11:42,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:11:42" (1/1) ... [2022-07-13 11:11:42,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:11:42" (1/1) ... [2022-07-13 11:11:42,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:11:42" (1/1) ... [2022-07-13 11:11:42,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:11:42" (1/1) ... [2022-07-13 11:11:42,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:11:42" (1/1) ... [2022-07-13 11:11:42,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:11:42" (1/1) ... [2022-07-13 11:11:42,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:11:42,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:11:42,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:11:42,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:11:42,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:11:42" (1/1) ... [2022-07-13 11:11:42,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:11:42,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:11:42,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:11:42,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:11:42,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:11:42,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:11:42,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:11:42,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:11:42,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:11:42,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:11:42,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:11:42,599 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:11:42,600 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:11:42,755 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:11:42,759 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:11:42,760 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 11:11:42,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:11:42 BoogieIcfgContainer [2022-07-13 11:11:42,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:11:42,762 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:11:42,762 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:11:42,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:11:42,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:11:42" (1/3) ... [2022-07-13 11:11:42,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85321a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:11:42, skipping insertion in model container [2022-07-13 11:11:42,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:11:42" (2/3) ... [2022-07-13 11:11:42,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85321a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:11:42, skipping insertion in model container [2022-07-13 11:11:42,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:11:42" (3/3) ... [2022-07-13 11:11:42,787 INFO L111 eAbstractionObserver]: Analyzing ICFG pcompf.c [2022-07-13 11:11:42,797 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:11:42,797 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:11:42,838 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:11:42,844 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@f98e54, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58511812 [2022-07-13 11:11:42,845 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:11:42,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 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) [2022-07-13 11:11:42,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 11:11:42,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:11:42,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:11:42,860 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:11:42,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:11:42,867 INFO L85 PathProgramCache]: Analyzing trace with hash -592971038, now seen corresponding path program 1 times [2022-07-13 11:11:42,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:11:42,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592339968] [2022-07-13 11:11:42,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:11:42,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:11:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:11:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:11:42,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:11:42,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592339968] [2022-07-13 11:11:42,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592339968] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:11:42,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:11:42,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:11:42,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60198838] [2022-07-13 11:11:42,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:11:43,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 11:11:43,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:11:43,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 11:11:43,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:11:43,024 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2022-07-13 11:11:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:11:43,035 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-07-13 11:11:43,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 11:11:43,037 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2022-07-13 11:11:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:11:43,042 INFO L225 Difference]: With dead ends: 44 [2022-07-13 11:11:43,042 INFO L226 Difference]: Without dead ends: 20 [2022-07-13 11:11:43,044 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 [2022-07-13 11:11:43,050 INFO L413 NwaCegarLoop]: 28 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, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:11:43,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:11:43,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-13 11:11:43,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 11:11:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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) [2022-07-13 11:11:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-13 11:11:43,077 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2022-07-13 11:11:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:11:43,078 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-13 11:11:43,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2022-07-13 11:11:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-13 11:11:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 11:11:43,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:11:43,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:11:43,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:11:43,079 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:11:43,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:11:43,080 INFO L85 PathProgramCache]: Analyzing trace with hash 108093540, now seen corresponding path program 1 times [2022-07-13 11:11:43,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:11:43,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540942812] [2022-07-13 11:11:43,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:11:43,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:11:43,106 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:11:43,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1420823566] [2022-07-13 11:11:43,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:11:43,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:11:43,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:11:43,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:11:43,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 11:11:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:11:43,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 11:11:43,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:11:43,337 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-13 11:11:43,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-07-13 11:11:43,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-07-13 11:11:43,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-07-13 11:11:43,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-07-13 11:11:44,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:11:44,020 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-07-13 11:11:44,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 24 [2022-07-13 11:11:44,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:11:44,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:11:44,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 26 [2022-07-13 11:11:44,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:11:44,124 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-13 11:11:44,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 26 [2022-07-13 11:11:44,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:11:44,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 16 [2022-07-13 11:11:44,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:11:44,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:11:44,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:11:44,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 16 [2022-07-13 11:11:44,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:11:44,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:11:44,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 41 treesize of output 5 [2022-07-13 11:11:44,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:11:44,426 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-07-13 11:11:44,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 31 [2022-07-13 11:11:44,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:11:44,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:11:44,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:11:44,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:11:44,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540942812] [2022-07-13 11:11:44,540 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:11:44,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420823566] [2022-07-13 11:11:44,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420823566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:11:44,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:11:44,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:11:44,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544320333] [2022-07-13 11:11:44,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:11:44,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:11:44,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:11:44,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:11:44,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:11:44,543 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2022-07-13 11:11:44,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:11:44,607 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-07-13 11:11:44,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:11:44,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2022-07-13 11:11:44,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:11:44,609 INFO L225 Difference]: With dead ends: 39 [2022-07-13 11:11:44,609 INFO L226 Difference]: Without dead ends: 37 [2022-07-13 11:11:44,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:11:44,610 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:11:44,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 59 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:11:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-13 11:11:44,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2022-07-13 11:11:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 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) [2022-07-13 11:11:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-07-13 11:11:44,616 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 14 [2022-07-13 11:11:44,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:11:44,616 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-13 11:11:44,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2022-07-13 11:11:44,617 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-07-13 11:11:44,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 11:11:44,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:11:44,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:11:44,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:11:44,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:11:44,831 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:11:44,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:11:44,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1850906398, now seen corresponding path program 1 times [2022-07-13 11:11:44,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:11:44,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553870473] [2022-07-13 11:11:44,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:11:44,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:11:44,867 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:11:44,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1583250716] [2022-07-13 11:11:44,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:11:44,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:11:44,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:11:44,875 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:11:44,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 11:11:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:11:44,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 11:11:44,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:11:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:11:44,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:11:44,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:11:44,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553870473] [2022-07-13 11:11:44,965 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:11:44,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583250716] [2022-07-13 11:11:44,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583250716] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:11:44,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:11:44,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:11:44,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174493967] [2022-07-13 11:11:44,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:11:44,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:11:44,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:11:44,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:11:44,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:11:44,968 INFO L87 Difference]: Start difference. First operand 28 states and 34 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) [2022-07-13 11:11:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:11:45,045 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-07-13 11:11:45,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:11:45,046 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 [2022-07-13 11:11:45,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:11:45,046 INFO L225 Difference]: With dead ends: 62 [2022-07-13 11:11:45,046 INFO L226 Difference]: Without dead ends: 50 [2022-07-13 11:11:45,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:11:45,048 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:11:45,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 32 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:11:45,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-13 11:11:45,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2022-07-13 11:11:45,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 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) [2022-07-13 11:11:45,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-13 11:11:45,052 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 16 [2022-07-13 11:11:45,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:11:45,052 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-13 11:11:45,052 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) [2022-07-13 11:11:45,052 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-13 11:11:45,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 11:11:45,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:11:45,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:11:45,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:11:45,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-13 11:11:45,272 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:11:45,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:11:45,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1060218526, now seen corresponding path program 1 times [2022-07-13 11:11:45,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:11:45,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769605325] [2022-07-13 11:11:45,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:11:45,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:11:45,288 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:11:45,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [526263074] [2022-07-13 11:11:45,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:11:45,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:11:45,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:11:45,290 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) [2022-07-13 11:11:45,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 11:11:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:11:45,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 11:11:45,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:11:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:11:45,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:11:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:11:45,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:11:45,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769605325] [2022-07-13 11:11:45,375 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:11:45,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526263074] [2022-07-13 11:11:45,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526263074] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:11:45,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:11:45,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-07-13 11:11:45,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077787854] [2022-07-13 11:11:45,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:11:45,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:11:45,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:11:45,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:11:45,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:11:45,377 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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) [2022-07-13 11:11:45,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:11:45,444 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-07-13 11:11:45,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:11:45,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 16 [2022-07-13 11:11:45,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:11:45,445 INFO L225 Difference]: With dead ends: 53 [2022-07-13 11:11:45,445 INFO L226 Difference]: Without dead ends: 44 [2022-07-13 11:11:45,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:11:45,446 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:11:45,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 44 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:11:45,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-13 11:11:45,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-07-13 11:11:45,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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) [2022-07-13 11:11:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-13 11:11:45,449 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2022-07-13 11:11:45,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:11:45,450 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-13 11:11:45,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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) [2022-07-13 11:11:45,450 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-13 11:11:45,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 11:11:45,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:11:45,450 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:11:45,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:11:45,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:11:45,663 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:11:45,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:11:45,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1120615462, now seen corresponding path program 1 times [2022-07-13 11:11:45,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:11:45,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505366917] [2022-07-13 11:11:45,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:11:45,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:11:45,677 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:11:45,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2103082707] [2022-07-13 11:11:45,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:11:45,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:11:45,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:11:45,679 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) [2022-07-13 11:11:45,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 11:11:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:11:45,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:11:45,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:11:45,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:11:45,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:11:45,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:11:45,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505366917] [2022-07-13 11:11:45,763 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:11:45,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103082707] [2022-07-13 11:11:45,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103082707] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:11:45,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:11:45,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:11:45,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641642771] [2022-07-13 11:11:45,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:11:45,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:11:45,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:11:45,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:11:45,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:11:45,765 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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) [2022-07-13 11:11:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:11:45,818 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-07-13 11:11:45,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:11:45,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 [2022-07-13 11:11:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:11:45,820 INFO L225 Difference]: With dead ends: 48 [2022-07-13 11:11:45,820 INFO L226 Difference]: Without dead ends: 32 [2022-07-13 11:11:45,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:11:45,822 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:11:45,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 34 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:11:45,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-13 11:11:45,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2022-07-13 11:11:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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) [2022-07-13 11:11:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-07-13 11:11:45,831 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2022-07-13 11:11:45,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:11:45,832 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-07-13 11:11:45,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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) [2022-07-13 11:11:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-07-13 11:11:45,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 11:11:45,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:11:45,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:11:45,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 11:11:46,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:11:46,048 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:11:46,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:11:46,048 INFO L85 PathProgramCache]: Analyzing trace with hash 615941150, now seen corresponding path program 1 times [2022-07-13 11:11:46,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:11:46,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44637801] [2022-07-13 11:11:46,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:11:46,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:11:46,072 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:11:46,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [726684127] [2022-07-13 11:11:46,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:11:46,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:11:46,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:11:46,085 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) [2022-07-13 11:11:46,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 11:11:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:11:46,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-13 11:11:46,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:11:46,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2022-07-13 11:11:46,204 INFO L356 Elim1Store]: treesize reduction 78, result has 41.4 percent of original size [2022-07-13 11:11:46,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 272 [2022-07-13 11:11:46,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-07-13 11:11:46,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-07-13 11:11:46,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-07-13 11:11:46,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:11:46,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 84 [2022-07-13 11:11:46,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:11:46,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:11:46,411 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:11:46,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:11:46,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 74 [2022-07-13 11:11:46,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:11:46,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:11:46,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 11 [2022-07-13 11:11:46,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:11:46,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:11:46,657 INFO L356 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2022-07-13 11:11:46,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 171 [2022-07-13 11:11:46,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:11:46,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:11:46,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:11:46,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 30 [2022-07-13 11:11:46,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-07-13 11:11:46,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:11:46,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-07-13 11:11:46,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:11:46,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:11:46,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:11:46,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:11:46,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44637801] [2022-07-13 11:11:46,919 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:11:46,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726684127] [2022-07-13 11:11:46,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726684127] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:11:46,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:11:46,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-07-13 11:11:46,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177489798] [2022-07-13 11:11:46,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:11:46,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 11:11:46,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:11:46,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 11:11:46,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=151, Unknown=1, NotChecked=0, Total=210 [2022-07-13 11:11:46,921 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 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) [2022-07-13 11:11:47,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:11:47,007 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-07-13 11:11:47,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:11:47,008 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 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 [2022-07-13 11:11:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:11:47,009 INFO L225 Difference]: With dead ends: 52 [2022-07-13 11:11:47,009 INFO L226 Difference]: Without dead ends: 50 [2022-07-13 11:11:47,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=218, Unknown=1, NotChecked=0, Total=306 [2022-07-13 11:11:47,009 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 28 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:11:47,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 155 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 88 Invalid, 0 Unknown, 99 Unchecked, 0.1s Time] [2022-07-13 11:11:47,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-13 11:11:47,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2022-07-13 11:11:47,013 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) [2022-07-13 11:11:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-07-13 11:11:47,013 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 20 [2022-07-13 11:11:47,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:11:47,013 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-07-13 11:11:47,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 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) [2022-07-13 11:11:47,014 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-07-13 11:11:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 11:11:47,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:11:47,014 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] [2022-07-13 11:11:47,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 11:11:47,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:11:47,231 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:11:47,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:11:47,231 INFO L85 PathProgramCache]: Analyzing trace with hash 859342364, now seen corresponding path program 2 times [2022-07-13 11:11:47,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:11:47,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342405162] [2022-07-13 11:11:47,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:11:47,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:11:47,246 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:11:47,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [357758670] [2022-07-13 11:11:47,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:11:47,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:11:47,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:11:47,248 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) [2022-07-13 11:11:47,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 11:11:47,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:11:47,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:11:47,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:11:47,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:11:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:11:47,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:11:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:11:47,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:11:47,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342405162] [2022-07-13 11:11:47,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:11:47,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357758670] [2022-07-13 11:11:47,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357758670] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:11:47,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:11:47,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-13 11:11:47,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721913328] [2022-07-13 11:11:47,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:11:47,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:11:47,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:11:47,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:11:47,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:11:47,350 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2022-07-13 11:11:47,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:11:47,437 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2022-07-13 11:11:47,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:11:47,437 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 [2022-07-13 11:11:47,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:11:47,438 INFO L225 Difference]: With dead ends: 81 [2022-07-13 11:11:47,438 INFO L226 Difference]: Without dead ends: 68 [2022-07-13 11:11:47,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:11:47,439 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 46 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:11:47,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 44 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:11:47,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-13 11:11:47,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 42. [2022-07-13 11:11:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 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) [2022-07-13 11:11:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-07-13 11:11:47,451 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 22 [2022-07-13 11:11:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:11:47,451 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-07-13 11:11:47,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2022-07-13 11:11:47,453 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-07-13 11:11:47,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 11:11:47,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:11:47,453 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] [2022-07-13 11:11:47,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 11:11:47,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:11:47,667 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:11:47,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:11:47,668 INFO L85 PathProgramCache]: Analyzing trace with hash 803751580, now seen corresponding path program 3 times [2022-07-13 11:11:47,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:11:47,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372755964] [2022-07-13 11:11:47,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:11:47,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:11:47,680 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:11:47,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [403562870] [2022-07-13 11:11:47,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:11:47,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:11:47,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:11:47,682 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:11:47,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 11:11:47,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 11:11:47,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:11:47,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:11:47,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:11:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:11:47,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:11:47,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:11:47,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:11:47,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372755964] [2022-07-13 11:11:47,807 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:11:47,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403562870] [2022-07-13 11:11:47,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403562870] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:11:47,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:11:47,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-13 11:11:47,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127928636] [2022-07-13 11:11:47,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:11:47,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:11:47,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:11:47,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:11:47,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:11:47,808 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2022-07-13 11:11:47,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:11:47,896 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2022-07-13 11:11:47,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:11:47,896 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 [2022-07-13 11:11:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:11:47,897 INFO L225 Difference]: With dead ends: 71 [2022-07-13 11:11:47,897 INFO L226 Difference]: Without dead ends: 60 [2022-07-13 11:11:47,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:11:47,897 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 52 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:11:47,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 56 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:11:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-13 11:11:47,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2022-07-13 11:11:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:11:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-07-13 11:11:47,900 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 22 [2022-07-13 11:11:47,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:11:47,900 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-07-13 11:11:47,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2022-07-13 11:11:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-07-13 11:11:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 11:11:47,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:11:47,901 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:11:47,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 11:11:48,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:11:48,103 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:11:48,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:11:48,104 INFO L85 PathProgramCache]: Analyzing trace with hash 678263444, now seen corresponding path program 1 times [2022-07-13 11:11:48,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:11:48,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433480226] [2022-07-13 11:11:48,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:11:48,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:11:48,115 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:11:48,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [188769514] [2022-07-13 11:11:48,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:11:48,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:11:48,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:11:48,117 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:11:48,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 11:11:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:11:48,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-13 11:11:48,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:11:48,185 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 11:11:48,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2022-07-13 11:11:48,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:11:48,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:11:48,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:11:48,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 22 [2022-07-13 11:11:48,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-07-13 11:11:48,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-07-13 11:11:48,218 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 11:11:48,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-07-13 11:11:48,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:11:48,249 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 11:11:48,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-07-13 11:11:48,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:11:48,272 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 11:11:48,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2022-07-13 11:11:48,359 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 11:11:48,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 66 treesize of output 38 [2022-07-13 11:11:48,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:11:48,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:11:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:11:48,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:11:48,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433480226] [2022-07-13 11:11:48,545 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:11:48,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188769514] [2022-07-13 11:11:48,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188769514] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:11:48,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:11:48,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2022-07-13 11:11:48,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618760429] [2022-07-13 11:11:48,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:11:48,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:11:48,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:11:48,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:11:48,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=209, Unknown=10, NotChecked=0, Total=272 [2022-07-13 11:11:48,558 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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) [2022-07-13 11:11:48,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:11:48,827 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-07-13 11:11:48,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:11:48,828 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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) Word has length 24 [2022-07-13 11:11:48,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:11:48,828 INFO L225 Difference]: With dead ends: 55 [2022-07-13 11:11:48,829 INFO L226 Difference]: Without dead ends: 53 [2022-07-13 11:11:48,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=391, Unknown=10, NotChecked=0, Total=552 [2022-07-13 11:11:48,829 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 58 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:11:48,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 150 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 102 Invalid, 0 Unknown, 74 Unchecked, 0.1s Time] [2022-07-13 11:11:48,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-13 11:11:48,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-07-13 11:11:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 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) [2022-07-13 11:11:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-07-13 11:11:48,833 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 24 [2022-07-13 11:11:48,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:11:48,833 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-07-13 11:11:48,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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) [2022-07-13 11:11:48,834 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-07-13 11:11:48,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 11:11:48,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:11:48,834 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:11:48,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 11:11:49,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-13 11:11:49,035 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:11:49,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:11:49,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1304966232, now seen corresponding path program 4 times [2022-07-13 11:11:49,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:11:49,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906181211] [2022-07-13 11:11:49,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:11:49,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:11:49,049 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:11:49,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1606571445] [2022-07-13 11:11:49,049 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:11:49,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:11:49,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:11:49,050 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:11:49,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 11:11:49,113 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:11:49,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:11:49,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 11:11:49,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:11:49,188 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-13 11:11:49,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-07-13 11:11:49,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-07-13 11:11:49,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-07-13 11:11:49,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-07-13 11:11:49,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:11:49,953 INFO L356 Elim1Store]: treesize reduction 24, result has 25.0 percent of original size [2022-07-13 11:11:49,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 151 [2022-07-13 11:11:49,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:11:49,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:11:50,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:11:50,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:11:50,029 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-13 11:11:50,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 194 treesize of output 147 [2022-07-13 11:11:50,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:11:50,069 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:11:50,072 INFO L356 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2022-07-13 11:11:50,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 334 treesize of output 271 [2022-07-13 11:11:50,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:11:50,091 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 11:11:50,098 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 11:11:50,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2022-07-13 11:11:50,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:11:50,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:11:50,191 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-13 11:11:50,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 113 [2022-07-13 11:11:50,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:11:50,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:11:50,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-13 11:11:50,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 11:11:50,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 11:11:50,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:11:50,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 22 [2022-07-13 11:11:50,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:11:50,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 22 [2022-07-13 11:11:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:11:50,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:11:52,384 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (forall ((v_ArrVal_576 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)))) is different from false [2022-07-13 11:11:52,738 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_575) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|) 0))) is different from false [2022-07-13 11:11:53,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_575) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)))) is different from false [2022-07-13 11:11:53,041 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_573 (Array Int Int))) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)) (= 0 (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |c_ULTIMATE.start_main_~c~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_575) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|)))) is different from false [2022-07-13 11:11:53,067 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (or (= (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_571) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |c_ULTIMATE.start_main_~c~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_575) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)))) is different from false [2022-07-13 11:11:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 9 not checked. [2022-07-13 11:11:53,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:11:53,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906181211] [2022-07-13 11:11:53,084 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:11:53,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606571445] [2022-07-13 11:11:53,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606571445] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:11:53,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:11:53,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2022-07-13 11:11:53,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578037843] [2022-07-13 11:11:53,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:11:53,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 11:11:53,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:11:53,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 11:11:53,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=117, Unknown=6, NotChecked=130, Total=306 [2022-07-13 11:11:53,086 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 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) [2022-07-13 11:11:53,219 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_573 (Array Int Int))) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)) (= 0 (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |c_ULTIMATE.start_main_~c~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_575) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (or (= (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_571) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |c_ULTIMATE.start_main_~c~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_575) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|))))) is different from false [2022-07-13 11:11:55,247 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (forall ((v_ArrVal_576 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)))) (= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-07-13 11:11:55,251 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_573 (Array Int Int))) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)) (= 0 (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |c_ULTIMATE.start_main_~c~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_575) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_575) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|))))) is different from false [2022-07-13 11:11:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:11:55,338 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-07-13 11:11:55,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 11:11:55,338 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 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 [2022-07-13 11:11:55,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:11:55,339 INFO L225 Difference]: With dead ends: 85 [2022-07-13 11:11:55,339 INFO L226 Difference]: Without dead ends: 83 [2022-07-13 11:11:55,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=118, Invalid=323, Unknown=11, NotChecked=360, Total=812 [2022-07-13 11:11:55,339 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 28 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:11:55,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 118 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 96 Invalid, 0 Unknown, 208 Unchecked, 0.1s Time] [2022-07-13 11:11:55,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-13 11:11:55,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2022-07-13 11:11:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 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) [2022-07-13 11:11:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-07-13 11:11:55,344 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 26 [2022-07-13 11:11:55,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:11:55,344 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-07-13 11:11:55,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 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) [2022-07-13 11:11:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-07-13 11:11:55,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 11:11:55,345 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:11:55,345 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:11:55,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 11:11:55,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-13 11:11:55,562 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:11:55,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:11:55,563 INFO L85 PathProgramCache]: Analyzing trace with hash -231193078, now seen corresponding path program 2 times [2022-07-13 11:11:55,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:11:55,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031464430] [2022-07-13 11:11:55,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:11:55,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:11:55,579 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:11:55,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [764896685] [2022-07-13 11:11:55,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:11:55,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:11:55,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:11:55,581 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:11:55,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 11:11:55,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:11:55,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:11:55,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 11:11:55,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:11:55,695 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:11:55,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:11:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:11:55,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:11:55,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031464430] [2022-07-13 11:11:55,730 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:11:55,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764896685] [2022-07-13 11:11:55,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764896685] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:11:55,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:11:55,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-07-13 11:11:55,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451788523] [2022-07-13 11:11:55,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:11:55,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:11:55,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:11:55,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:11:55,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:11:55,732 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:11:55,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:11:55,820 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-07-13 11:11:55,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:11:55,821 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-13 11:11:55,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:11:55,821 INFO L225 Difference]: With dead ends: 72 [2022-07-13 11:11:55,821 INFO L226 Difference]: Without dead ends: 48 [2022-07-13 11:11:55,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:11:55,822 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 54 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:11:55,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 45 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:11:55,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-13 11:11:55,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2022-07-13 11:11:55,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:11:55,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-07-13 11:11:55,825 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 28 [2022-07-13 11:11:55,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:11:55,825 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-07-13 11:11:55,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:11:55,826 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-07-13 11:11:55,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 11:11:55,826 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:11:55,826 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:11:55,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 11:11:56,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-13 11:11:56,035 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:11:56,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:11:56,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1587482582, now seen corresponding path program 5 times [2022-07-13 11:11:56,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:11:56,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088808675] [2022-07-13 11:11:56,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:11:56,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:11:56,051 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:11:56,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1933540696] [2022-07-13 11:11:56,059 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:11:56,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:11:56,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:11:56,060 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:11:56,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 11:11:56,160 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-13 11:11:56,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:11:56,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:11:56,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:11:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 11:11:56,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:11:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 11:11:56,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:11:56,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088808675] [2022-07-13 11:11:56,253 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:11:56,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933540696] [2022-07-13 11:11:56,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933540696] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:11:56,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:11:56,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-07-13 11:11:56,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665936606] [2022-07-13 11:11:56,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:11:56,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 11:11:56,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:11:56,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 11:11:56,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:11:56,254 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:11:56,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:11:56,383 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-07-13 11:11:56,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:11:56,383 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-13 11:11:56,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:11:56,384 INFO L225 Difference]: With dead ends: 102 [2022-07-13 11:11:56,384 INFO L226 Difference]: Without dead ends: 82 [2022-07-13 11:11:56,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-07-13 11:11:56,384 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 92 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:11:56,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 58 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:11:56,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-13 11:11:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 50. [2022-07-13 11:11:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 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) [2022-07-13 11:11:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-07-13 11:11:56,389 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2022-07-13 11:11:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:11:56,389 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-07-13 11:11:56,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:11:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-07-13 11:11:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 11:11:56,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:11:56,390 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:11:56,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 11:11:56,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-13 11:11:56,590 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:11:56,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:11:56,590 INFO L85 PathProgramCache]: Analyzing trace with hash 341343694, now seen corresponding path program 3 times [2022-07-13 11:11:56,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:11:56,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598952458] [2022-07-13 11:11:56,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:11:56,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:11:56,605 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:11:56,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1144074323] [2022-07-13 11:11:56,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:11:56,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:11:56,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:11:56,612 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:11:56,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 11:11:56,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 11:11:56,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:11:56,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-13 11:11:56,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:11:57,056 INFO L356 Elim1Store]: treesize reduction 252, result has 37.8 percent of original size [2022-07-13 11:11:57,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 226 treesize of output 790 [2022-07-13 11:11:57,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 15 [2022-07-13 11:11:57,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 15 [2022-07-13 11:11:57,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 37 treesize of output 33 [2022-07-13 11:12:00,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:12:12,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 413 treesize of output 388 [2022-07-13 11:12:14,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 252 treesize of output 203 [2022-07-13 11:12:14,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 122 treesize of output 103 [2022-07-13 11:12:15,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 71 treesize of output 66 [2022-07-13 11:12:15,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 64 [2022-07-13 11:12:15,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 122 treesize of output 103 [2022-07-13 11:12:15,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 166 treesize of output 157 [2022-07-13 11:12:18,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 4666 treesize of output 4305 [2022-07-13 11:12:20,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:20,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 19 treesize of output 3 [2022-07-13 11:12:21,135 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:21,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 19 treesize of output 3 [2022-07-13 11:12:21,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:21,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 19 treesize of output 3 [2022-07-13 11:12:25,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:25,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 19 treesize of output 3 [2022-07-13 11:12:26,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:26,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 19 treesize of output 3 [2022-07-13 11:12:26,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:26,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 19 treesize of output 3 [2022-07-13 11:12:26,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:26,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 19 treesize of output 3 [2022-07-13 11:12:26,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:26,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 19 treesize of output 3 [2022-07-13 11:12:34,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:34,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:34,603 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:34,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:34,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:34,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:34,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:34,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:34,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:34,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:35,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:35,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:35,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:35,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:35,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:35,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:43,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:43,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:43,411 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:43,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:43,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:43,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:43,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:43,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:43,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:43,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:44,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:44,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:44,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:44,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:44,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:44,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:54,157 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 41 [2022-07-13 11:12:54,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,289 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 38 [2022-07-13 11:12:54,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:12:54,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 45 [2022-07-13 11:12:54,317 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 11:12:54,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,615 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,615 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 35 [2022-07-13 11:12:54,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:12:54,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 117 treesize of output 82 [2022-07-13 11:12:54,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:12:54,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:54,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 117 treesize of output 82 [2022-07-13 11:12:54,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:12:54,975 INFO L356 Elim1Store]: treesize reduction 47, result has 26.6 percent of original size [2022-07-13 11:12:54,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 4054 treesize of output 3881 [2022-07-13 11:12:55,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:12:55,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:12:55,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-13 11:12:56,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:56,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 10 [2022-07-13 11:12:56,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:56,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:56,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:56,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 10 [2022-07-13 11:12:57,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:57,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 10 [2022-07-13 11:12:57,096 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:57,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:57,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:57,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:57,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:12:57,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 25 treesize of output 3 [2022-07-13 11:12:57,976 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 11:12:57,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2022-07-13 11:12:58,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:58,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:58,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:12:58,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 185 [2022-07-13 11:12:58,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:12:58,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598952458] [2022-07-13 11:12:58,081 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:12:58,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144074323] [2022-07-13 11:12:58,081 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 11:12:58,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 11:12:58,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 11:12:58,282 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 11:12:58,284 INFO L158 Benchmark]: Toolchain (without parser) took 76086.34ms. Allocated memory was 134.2MB in the beginning and 339.7MB in the end (delta: 205.5MB). Free memory was 100.8MB in the beginning and 118.3MB in the end (delta: -17.4MB). Peak memory consumption was 186.9MB. Max. memory is 16.1GB. [2022-07-13 11:12:58,285 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory was 59.2MB in the beginning and 59.2MB in the end (delta: 26.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:12:58,285 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.43ms. Allocated memory is still 134.2MB. Free memory was 100.8MB in the beginning and 109.7MB in the end (delta: -8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 11:12:58,285 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.97ms. Allocated memory is still 134.2MB. Free memory was 109.7MB in the beginning and 108.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:12:58,285 INFO L158 Benchmark]: Boogie Preprocessor took 30.93ms. Allocated memory is still 134.2MB. Free memory was 108.4MB in the beginning and 106.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:12:58,285 INFO L158 Benchmark]: RCFGBuilder took 282.52ms. Allocated memory is still 134.2MB. Free memory was 106.7MB in the beginning and 95.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 11:12:58,286 INFO L158 Benchmark]: TraceAbstraction took 75522.21ms. Allocated memory was 134.2MB in the beginning and 339.7MB in the end (delta: 205.5MB). Free memory was 94.3MB in the beginning and 118.3MB in the end (delta: -23.9MB). Peak memory consumption was 183.7MB. Max. memory is 16.1GB. [2022-07-13 11:12:58,286 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.16ms. Allocated memory is still 88.1MB. Free memory was 59.2MB in the beginning and 59.2MB in the end (delta: 26.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.43ms. Allocated memory is still 134.2MB. Free memory was 100.8MB in the beginning and 109.7MB in the end (delta: -8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.97ms. Allocated memory is still 134.2MB. Free memory was 109.7MB in the beginning and 108.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.93ms. Allocated memory is still 134.2MB. Free memory was 108.4MB in the beginning and 106.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 282.52ms. Allocated memory is still 134.2MB. Free memory was 106.7MB in the beginning and 95.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 75522.21ms. Allocated memory was 134.2MB in the beginning and 339.7MB in the end (delta: 205.5MB). Free memory was 94.3MB in the beginning and 118.3MB in the end (delta: -23.9MB). Peak memory consumption was 183.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 11:12:58,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/array-fpi/pcompf.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 f995d1a14a0e61f10b2f5817b1ff2bf8d1511dbe7297ad48450a11ed6f3a9160 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:12:59,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:12:59,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:12:59,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:12:59,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:12:59,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:12:59,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:12:59,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:12:59,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:12:59,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:12:59,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:12:59,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:12:59,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:12:59,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:12:59,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:12:59,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:12:59,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:12:59,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:12:59,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:12:59,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:12:59,907 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:12:59,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:12:59,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:12:59,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:12:59,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:12:59,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:12:59,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:12:59,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:12:59,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:12:59,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:12:59,921 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:12:59,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:12:59,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:12:59,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:12:59,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:12:59,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:12:59,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:12:59,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:12:59,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:12:59,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:12:59,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:12:59,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:12:59,930 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 11:12:59,953 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:12:59,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:12:59,954 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:12:59,954 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:12:59,954 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:12:59,954 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:12:59,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:12:59,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:12:59,955 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:12:59,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:12:59,956 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:12:59,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:12:59,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:12:59,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:12:59,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:12:59,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:12:59,956 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 11:12:59,956 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 11:12:59,957 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 11:12:59,957 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:12:59,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:12:59,957 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:12:59,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:12:59,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:12:59,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:12:59,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:12:59,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:12:59,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:12:59,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:12:59,957 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:12:59,958 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 11:12:59,958 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 11:12:59,958 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:12:59,958 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:12:59,958 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:12:59,958 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 11:12:59,958 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> f995d1a14a0e61f10b2f5817b1ff2bf8d1511dbe7297ad48450a11ed6f3a9160 [2022-07-13 11:13:00,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:13:00,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:13:00,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:13:00,215 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:13:00,216 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:13:00,217 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/pcompf.c [2022-07-13 11:13:00,267 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e7583abb/419c9e4134da4e0cbd52163d56f84428/FLAG8b979c6fb [2022-07-13 11:13:00,629 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:13:00,629 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/pcompf.c [2022-07-13 11:13:00,633 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e7583abb/419c9e4134da4e0cbd52163d56f84428/FLAG8b979c6fb [2022-07-13 11:13:00,645 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e7583abb/419c9e4134da4e0cbd52163d56f84428 [2022-07-13 11:13:00,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:13:00,647 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:13:00,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:13:00,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:13:00,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:13:00,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:13:00" (1/1) ... [2022-07-13 11:13:00,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5830c478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:00, skipping insertion in model container [2022-07-13 11:13:00,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:13:00" (1/1) ... [2022-07-13 11:13:00,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:13:00,668 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:13:00,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/pcompf.c[589,602] [2022-07-13 11:13:00,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:13:00,842 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:13:00,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/pcompf.c[589,602] [2022-07-13 11:13:00,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:13:00,883 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:13:00,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:00 WrapperNode [2022-07-13 11:13:00,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:13:00,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:13:00,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:13:00,884 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:13:00,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:00" (1/1) ... [2022-07-13 11:13:00,902 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:00" (1/1) ... [2022-07-13 11:13:00,922 INFO L137 Inliner]: procedures = 18, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2022-07-13 11:13:00,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:13:00,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:13:00,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:13:00,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:13:00,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:00" (1/1) ... [2022-07-13 11:13:00,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:00" (1/1) ... [2022-07-13 11:13:00,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:00" (1/1) ... [2022-07-13 11:13:00,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:00" (1/1) ... [2022-07-13 11:13:00,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:00" (1/1) ... [2022-07-13 11:13:00,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:00" (1/1) ... [2022-07-13 11:13:00,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:00" (1/1) ... [2022-07-13 11:13:00,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:13:00,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:13:00,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:13:00,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:13:00,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:00" (1/1) ... [2022-07-13 11:13:00,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:13:00,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:13:00,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:13:01,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:13:01,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:13:01,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 11:13:01,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-13 11:13:01,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:13:01,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:13:01,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:13:01,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-13 11:13:01,083 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:13:01,085 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:13:01,249 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:13:01,253 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:13:01,259 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 11:13:01,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:13:01 BoogieIcfgContainer [2022-07-13 11:13:01,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:13:01,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:13:01,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:13:01,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:13:01,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:13:00" (1/3) ... [2022-07-13 11:13:01,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5886e8cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:13:01, skipping insertion in model container [2022-07-13 11:13:01,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:13:00" (2/3) ... [2022-07-13 11:13:01,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5886e8cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:13:01, skipping insertion in model container [2022-07-13 11:13:01,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:13:01" (3/3) ... [2022-07-13 11:13:01,265 INFO L111 eAbstractionObserver]: Analyzing ICFG pcompf.c [2022-07-13 11:13:01,273 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:13:01,273 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:13:01,336 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:13:01,341 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6380a18d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5cfd6e57 [2022-07-13 11:13:01,341 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:13:01,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 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) [2022-07-13 11:13:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 11:13:01,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:01,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:01,355 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:01,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:01,358 INFO L85 PathProgramCache]: Analyzing trace with hash -592971038, now seen corresponding path program 1 times [2022-07-13 11:13:01,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:13:01,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816938488] [2022-07-13 11:13:01,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:01,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:13:01,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:13:01,373 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:13:01,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 11:13:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:01,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 11:13:01,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:01,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:13:01,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:13:01,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816938488] [2022-07-13 11:13:01,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816938488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:13:01,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:13:01,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:13:01,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161295892] [2022-07-13 11:13:01,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:13:01,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 11:13:01,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:13:01,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 11:13:01,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:13:01,535 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2022-07-13 11:13:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:01,546 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-07-13 11:13:01,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 11:13:01,548 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2022-07-13 11:13:01,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:01,552 INFO L225 Difference]: With dead ends: 44 [2022-07-13 11:13:01,553 INFO L226 Difference]: Without dead ends: 20 [2022-07-13 11:13:01,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:13:01,557 INFO L413 NwaCegarLoop]: 28 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, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:01,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:13:01,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-13 11:13:01,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 11:13:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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) [2022-07-13 11:13:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-13 11:13:01,578 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2022-07-13 11:13:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:01,578 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-13 11:13:01,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2022-07-13 11:13:01,579 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-13 11:13:01,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 11:13:01,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:01,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:01,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:13:01,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:13:01,787 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:01,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash 108093540, now seen corresponding path program 1 times [2022-07-13 11:13:01,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:13:01,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690525914] [2022-07-13 11:13:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:01,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:13:01,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:13:01,790 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:13:01,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 11:13:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:01,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 11:13:01,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:02,173 INFO L356 Elim1Store]: treesize reduction 159, result has 28.7 percent of original size [2022-07-13 11:13:02,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 250 treesize of output 302 [2022-07-13 11:13:02,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:02,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:02,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 19 [2022-07-13 11:13:02,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:02,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:02,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 19 [2022-07-13 11:13:02,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:02,289 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:02,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 19 [2022-07-13 11:13:02,956 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-13 11:13:02,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 28 [2022-07-13 11:13:02,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:02,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-07-13 11:13:03,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:03,052 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-07-13 11:13:03,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 50 [2022-07-13 11:13:03,166 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:03,182 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-07-13 11:13:03,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 40 [2022-07-13 11:13:03,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:03,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-07-13 11:13:03,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:03,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-07-13 11:13:03,677 INFO L356 Elim1Store]: treesize reduction 47, result has 26.6 percent of original size [2022-07-13 11:13:03,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 66 treesize of output 41 [2022-07-13 11:13:03,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:03,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-07-13 11:13:03,766 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:13:03,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 31 [2022-07-13 11:13:03,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:03,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:13:03,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:13:03,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690525914] [2022-07-13 11:13:03,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690525914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:13:03,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:13:03,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:13:03,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998498624] [2022-07-13 11:13:03,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:13:03,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:13:03,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:13:03,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:13:03,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:13:03,780 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2022-07-13 11:13:03,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:03,983 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-07-13 11:13:03,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:13:03,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2022-07-13 11:13:03,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:03,984 INFO L225 Difference]: With dead ends: 39 [2022-07-13 11:13:03,985 INFO L226 Difference]: Without dead ends: 37 [2022-07-13 11:13:03,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:13:03,986 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:03,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 65 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:13:03,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-13 11:13:03,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2022-07-13 11:13:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 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) [2022-07-13 11:13:03,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-07-13 11:13:03,990 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 14 [2022-07-13 11:13:03,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:03,990 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-13 11:13:03,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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) [2022-07-13 11:13:03,990 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-07-13 11:13:03,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 11:13:03,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:03,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:04,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:13:04,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:13:04,191 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:04,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:04,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1850906398, now seen corresponding path program 1 times [2022-07-13 11:13:04,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:13:04,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37937020] [2022-07-13 11:13:04,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:04,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:13:04,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:13:04,193 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:13:04,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 11:13:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:04,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:13:04,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:04,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:13:04,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:13:04,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37937020] [2022-07-13 11:13:04,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37937020] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:13:04,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:13:04,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:13:04,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628813144] [2022-07-13 11:13:04,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:13:04,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:13:04,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:13:04,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:13:04,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:13:04,334 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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) [2022-07-13 11:13:04,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:04,532 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-07-13 11:13:04,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:13:04,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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 [2022-07-13 11:13:04,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:04,535 INFO L225 Difference]: With dead ends: 54 [2022-07-13 11:13:04,535 INFO L226 Difference]: Without dead ends: 42 [2022-07-13 11:13:04,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:13:04,536 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 73 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:04,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 23 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:13:04,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-13 11:13:04,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2022-07-13 11:13:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 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) [2022-07-13 11:13:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-13 11:13:04,540 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 16 [2022-07-13 11:13:04,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:04,541 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-13 11:13:04,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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) [2022-07-13 11:13:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-13 11:13:04,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 11:13:04,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:04,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:04,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:13:04,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:13:04,751 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:04,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:04,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1060218526, now seen corresponding path program 1 times [2022-07-13 11:13:04,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:13:04,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099281884] [2022-07-13 11:13:04,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:04,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:13:04,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:13:04,753 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:13:04,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 11:13:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:04,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 11:13:04,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:04,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:05,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:13:05,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099281884] [2022-07-13 11:13:05,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099281884] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:05,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:13:05,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2022-07-13 11:13:05,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293111356] [2022-07-13 11:13:05,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:05,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:13:05,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:13:05,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:13:05,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:13:05,005 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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) [2022-07-13 11:13:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:05,547 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-07-13 11:13:05,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:13:05,547 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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) Word has length 16 [2022-07-13 11:13:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:05,548 INFO L225 Difference]: With dead ends: 76 [2022-07-13 11:13:05,548 INFO L226 Difference]: Without dead ends: 62 [2022-07-13 11:13:05,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2022-07-13 11:13:05,549 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 159 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:05,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 44 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:13:05,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-13 11:13:05,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2022-07-13 11:13:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 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) [2022-07-13 11:13:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-07-13 11:13:05,554 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 16 [2022-07-13 11:13:05,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:05,554 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-07-13 11:13:05,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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) [2022-07-13 11:13:05,554 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-07-13 11:13:05,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 11:13:05,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:05,555 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:05,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 11:13:05,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:13:05,762 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:05,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:05,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1120615462, now seen corresponding path program 1 times [2022-07-13 11:13:05,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:13:05,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802151956] [2022-07-13 11:13:05,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:05,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:13:05,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:13:05,775 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:13:05,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 11:13:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:05,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 11:13:05,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:05,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:06,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:13:06,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802151956] [2022-07-13 11:13:06,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802151956] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:06,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:13:06,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2022-07-13 11:13:06,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025012003] [2022-07-13 11:13:06,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:06,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 11:13:06,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:13:06,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 11:13:06,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:13:06,035 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:06,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:06,381 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-07-13 11:13:06,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:13:06,383 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-13 11:13:06,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:06,383 INFO L225 Difference]: With dead ends: 53 [2022-07-13 11:13:06,384 INFO L226 Difference]: Without dead ends: 37 [2022-07-13 11:13:06,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-07-13 11:13:06,385 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 70 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:06,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 31 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:13:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-13 11:13:06,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2022-07-13 11:13:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-07-13 11:13:06,392 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 18 [2022-07-13 11:13:06,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:06,392 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-07-13 11:13:06,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:13:06,393 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-07-13 11:13:06,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 11:13:06,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:06,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:06,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-13 11:13:06,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:13:06,595 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:06,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:06,596 INFO L85 PathProgramCache]: Analyzing trace with hash 615941150, now seen corresponding path program 1 times [2022-07-13 11:13:06,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:13:06,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61778586] [2022-07-13 11:13:06,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:06,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:13:06,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:13:06,597 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:13:06,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 11:13:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:06,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 11:13:06,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:06,776 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 11:13:06,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 21 [2022-07-13 11:13:06,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:06,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:06,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-07-13 11:13:06,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:06,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:06,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 19 [2022-07-13 11:13:06,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-13 11:13:06,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-07-13 11:13:06,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:06,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:06,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:06,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:06,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:06,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:06,936 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:13:06,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 43 [2022-07-13 11:13:06,971 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:13:06,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 31 [2022-07-13 11:13:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:06,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:07,178 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ sign_extend 32) (_ bv0 32)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_main_~c~0#1.base|))) (concat (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~c~0#1.offset|)) (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|))))) is different from false [2022-07-13 11:13:07,228 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_main_~c~0#1.base|))) (concat (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~c~0#1.offset|)) (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|))) ((_ sign_extend 32) (_ bv0 32)))) is different from false [2022-07-13 11:13:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-13 11:13:07,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:13:07,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61778586] [2022-07-13 11:13:07,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61778586] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:07,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:13:07,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-13 11:13:07,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144214351] [2022-07-13 11:13:07,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:07,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:13:07,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:13:07,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:13:07,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=99, Unknown=2, NotChecked=42, Total=182 [2022-07-13 11:13:07,256 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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) [2022-07-13 11:13:07,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:07,693 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-07-13 11:13:07,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:13:07,694 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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 [2022-07-13 11:13:07,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:07,695 INFO L225 Difference]: With dead ends: 57 [2022-07-13 11:13:07,695 INFO L226 Difference]: Without dead ends: 55 [2022-07-13 11:13:07,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=214, Unknown=2, NotChecked=66, Total=380 [2022-07-13 11:13:07,696 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 77 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:07,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 72 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 53 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2022-07-13 11:13:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-13 11:13:07,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2022-07-13 11:13:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 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) [2022-07-13 11:13:07,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-07-13 11:13:07,700 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 20 [2022-07-13 11:13:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:07,700 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-07-13 11:13:07,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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) [2022-07-13 11:13:07,701 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-07-13 11:13:07,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 11:13:07,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:07,701 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:07,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-13 11:13:07,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:13:07,904 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:07,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:07,904 INFO L85 PathProgramCache]: Analyzing trace with hash 678263444, now seen corresponding path program 1 times [2022-07-13 11:13:07,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:13:07,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675086097] [2022-07-13 11:13:07,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:13:07,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:13:07,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:13:07,905 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:13:07,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 11:13:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:13:08,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-13 11:13:08,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:08,076 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 11:13:08,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 21 [2022-07-13 11:13:08,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 64 [2022-07-13 11:13:08,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:08,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 112 treesize of output 76 [2022-07-13 11:13:08,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:08,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:08,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-13 11:13:08,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:08,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:08,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-07-13 11:13:08,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:08,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:08,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:08,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:08,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:08,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:08,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2022-07-13 11:13:08,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:08,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:08,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:08,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:08,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:08,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:08,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 71 [2022-07-13 11:13:08,808 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-07-13 11:13:08,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 123 treesize of output 63 [2022-07-13 11:13:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:08,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:10,656 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_280 (_ BitVec 32)) (v_ArrVal_279 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_277))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse0 (let ((.cse3 (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse2 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv8 32)) v_ArrVal_280) (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv12 32)) v_ArrVal_279)) |c_ULTIMATE.start_main_~c~0#1.base|))) (concat (select .cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~c~0#1.offset|)) (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|))))) (or (not (= ((_ sign_extend 32) (_ bv0 32)) .cse0)) (= ((_ sign_extend 32) (_ bv1 32)) (let ((.cse1 (bvadd (concat (select .cse2 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32))) (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)) .cse0))) (concat ((_ extract 63 32) .cse1) ((_ extract 31 0) .cse1))))))))) is different from false [2022-07-13 11:13:10,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-13 11:13:10,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:13:10,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675086097] [2022-07-13 11:13:10,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675086097] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:10,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:13:10,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2022-07-13 11:13:10,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647764723] [2022-07-13 11:13:10,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:10,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 11:13:10,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:13:10,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 11:13:10,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=347, Unknown=1, NotChecked=38, Total=462 [2022-07-13 11:13:10,694 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 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) [2022-07-13 11:13:10,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:10,893 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-07-13 11:13:10,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:13:10,894 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 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 [2022-07-13 11:13:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:10,894 INFO L225 Difference]: With dead ends: 53 [2022-07-13 11:13:10,894 INFO L226 Difference]: Without dead ends: 51 [2022-07-13 11:13:10,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=95, Invalid=414, Unknown=1, NotChecked=42, Total=552 [2022-07-13 11:13:10,895 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:10,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 138 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 78 Unchecked, 0.0s Time] [2022-07-13 11:13:10,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-13 11:13:10,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-07-13 11:13:10,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 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) [2022-07-13 11:13:10,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-07-13 11:13:10,905 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 24 [2022-07-13 11:13:10,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:10,905 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-07-13 11:13:10,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 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) [2022-07-13 11:13:10,905 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-07-13 11:13:10,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 11:13:10,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:10,908 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] [2022-07-13 11:13:10,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-13 11:13:11,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:13:11,112 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:11,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:11,112 INFO L85 PathProgramCache]: Analyzing trace with hash -404894190, now seen corresponding path program 2 times [2022-07-13 11:13:11,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:13:11,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044609768] [2022-07-13 11:13:11,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:13:11,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:13:11,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:13:11,113 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:13:11,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-13 11:13:11,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:13:11,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:13:11,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 11:13:11,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:11,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 11:13:11,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:11,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:13:11,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:13:11,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044609768] [2022-07-13 11:13:11,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044609768] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:11,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:13:11,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2022-07-13 11:13:11,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686835921] [2022-07-13 11:13:11,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:11,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 11:13:11,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:13:11,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 11:13:11,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-07-13 11:13:11,596 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 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) [2022-07-13 11:13:13,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:13,085 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2022-07-13 11:13:13,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 11:13:13,087 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 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 26 [2022-07-13 11:13:13,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:13,087 INFO L225 Difference]: With dead ends: 122 [2022-07-13 11:13:13,087 INFO L226 Difference]: Without dead ends: 92 [2022-07-13 11:13:13,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=508, Invalid=1654, Unknown=0, NotChecked=0, Total=2162 [2022-07-13 11:13:13,089 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 353 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:13,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 83 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:13:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-13 11:13:13,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 60. [2022-07-13 11:13:13,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 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) [2022-07-13 11:13:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2022-07-13 11:13:13,108 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 26 [2022-07-13 11:13:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:13,108 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2022-07-13 11:13:13,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 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) [2022-07-13 11:13:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-07-13 11:13:13,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 11:13:13,109 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:13,109 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:13,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-13 11:13:13,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:13:13,313 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:13,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:13,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1304966232, now seen corresponding path program 2 times [2022-07-13 11:13:13,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:13:13,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231964102] [2022-07-13 11:13:13,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:13:13,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:13:13,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:13:13,315 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:13:13,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-13 11:13:13,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:13:13,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:13:13,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-13 11:13:13,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:13,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 13 [2022-07-13 11:13:13,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:13,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:13,557 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 11:13:13,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 24 treesize of output 30 [2022-07-13 11:13:13,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:13,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:13,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 19 [2022-07-13 11:13:13,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-07-13 11:13:13,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-07-13 11:13:13,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-07-13 11:13:13,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-07-13 11:13:13,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:13,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:13,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:13,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:13,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:13,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:13,718 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:13:13,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 48 [2022-07-13 11:13:13,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:13,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:13,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:13,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:13,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:13,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:13,748 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:13:13,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 43 [2022-07-13 11:13:13,787 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 11:13:13,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 31 [2022-07-13 11:13:13,800 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:13:13,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:14,141 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ sign_extend 32) (_ bv0 32)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_386) |c_ULTIMATE.start_main_~c~0#1.base|))) (concat (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~c~0#1.offset|)) (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|))))) is different from false [2022-07-13 11:13:14,169 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_384 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_386 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ sign_extend 32) (_ bv0 32)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_384) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_386) |c_ULTIMATE.start_main_~c~0#1.base|))) (concat (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~c~0#1.offset|)) (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|))))) is different from false [2022-07-13 11:13:14,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2022-07-13 11:13:14,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:13:14,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231964102] [2022-07-13 11:13:14,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231964102] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:14,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:13:14,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2022-07-13 11:13:14,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702988990] [2022-07-13 11:13:14,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:14,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 11:13:14,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:13:14,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 11:13:14,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=159, Unknown=2, NotChecked=54, Total=272 [2022-07-13 11:13:14,187 INFO L87 Difference]: Start difference. First operand 60 states and 66 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) [2022-07-13 11:13:15,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:15,203 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-07-13 11:13:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 11:13:15,204 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 26 [2022-07-13 11:13:15,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:15,205 INFO L225 Difference]: With dead ends: 116 [2022-07-13 11:13:15,205 INFO L226 Difference]: Without dead ends: 114 [2022-07-13 11:13:15,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=280, Invalid=916, Unknown=2, NotChecked=134, Total=1332 [2022-07-13 11:13:15,206 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 124 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:15,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 141 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 125 Invalid, 0 Unknown, 136 Unchecked, 0.3s Time] [2022-07-13 11:13:15,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-13 11:13:15,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 65. [2022-07-13 11:13:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 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) [2022-07-13 11:13:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-07-13 11:13:15,212 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 26 [2022-07-13 11:13:15,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:15,212 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-07-13 11:13:15,212 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) [2022-07-13 11:13:15,212 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-07-13 11:13:15,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 11:13:15,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:15,213 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:15,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 11:13:15,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:13:15,424 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:15,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:15,425 INFO L85 PathProgramCache]: Analyzing trace with hash -231193078, now seen corresponding path program 3 times [2022-07-13 11:13:15,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:13:15,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438946780] [2022-07-13 11:13:15,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:13:15,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:13:15,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:13:15,426 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:13:15,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-13 11:13:15,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 11:13:15,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:13:15,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 11:13:15,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:13:15,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:13:15,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:13:15,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438946780] [2022-07-13 11:13:15,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438946780] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:15,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:13:15,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2022-07-13 11:13:15,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339310952] [2022-07-13 11:13:15,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:15,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 11:13:15,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:13:15,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 11:13:15,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2022-07-13 11:13:15,899 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 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) [2022-07-13 11:13:16,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:16,553 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-07-13 11:13:16,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:13:16,554 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 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 28 [2022-07-13 11:13:16,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:16,555 INFO L225 Difference]: With dead ends: 83 [2022-07-13 11:13:16,555 INFO L226 Difference]: Without dead ends: 59 [2022-07-13 11:13:16,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2022-07-13 11:13:16,556 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 131 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:16,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 59 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:13:16,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-13 11:13:16,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2022-07-13 11:13:16,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 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) [2022-07-13 11:13:16,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-07-13 11:13:16,561 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 28 [2022-07-13 11:13:16,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:16,561 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-07-13 11:13:16,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 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) [2022-07-13 11:13:16,561 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-07-13 11:13:16,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 11:13:16,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:16,561 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:16,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-13 11:13:16,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:13:16,770 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:16,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:16,770 INFO L85 PathProgramCache]: Analyzing trace with hash 341343694, now seen corresponding path program 4 times [2022-07-13 11:13:16,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:13:16,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526435881] [2022-07-13 11:13:16,771 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:13:16,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:13:16,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:13:16,772 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:13:16,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-13 11:13:17,003 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:13:17,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:13:17,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-13 11:13:17,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:13:17,031 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 11:13:17,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 21 [2022-07-13 11:13:17,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:17,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-07-13 11:13:17,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 42 [2022-07-13 11:13:17,127 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 11:13:17,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 37 [2022-07-13 11:13:17,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-13 11:13:17,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 46 [2022-07-13 11:13:17,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2022-07-13 11:13:17,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,363 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:17,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:13:17,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 90 [2022-07-13 11:13:17,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:13:17,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93 [2022-07-13 11:13:17,980 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-07-13 11:13:17,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 119 treesize of output 59 [2022-07-13 11:13:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:13:18,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:13:22,434 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 (_ BitVec 32)) (v_ArrVal_505 (_ BitVec 32)) (v_ArrVal_504 (_ BitVec 32)) (v_ArrVal_503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_509 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_503))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (let ((.cse3 (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (store (store .cse1 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv8 32)) v_ArrVal_505) (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv12 32)) v_ArrVal_504) (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv16 32)) v_ArrVal_509) (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv20 32)) v_ArrVal_508)) |c_ULTIMATE.start_main_~c~0#1.base|))) (concat (select .cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~c~0#1.offset|)) (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|))))) (or (= ((_ sign_extend 32) (_ bv1 32)) (let ((.cse0 (bvadd (concat (select .cse1 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv4 32))) (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|)) .cse2))) (concat ((_ extract 63 32) .cse0) ((_ extract 31 0) .cse0)))) (not (= ((_ sign_extend 32) (_ bv0 32)) .cse2))))))) is different from false [2022-07-13 11:13:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-07-13 11:13:22,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 11:13:22,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526435881] [2022-07-13 11:13:22,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526435881] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:13:22,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:13:22,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2022-07-13 11:13:22,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475407652] [2022-07-13 11:13:22,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:13:22,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-13 11:13:22,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 11:13:22,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-13 11:13:22,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=736, Unknown=1, NotChecked=56, Total=930 [2022-07-13 11:13:22,492 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 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) [2022-07-13 11:13:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:13:24,739 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2022-07-13 11:13:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 11:13:24,740 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 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 30 [2022-07-13 11:13:24,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:13:24,740 INFO L225 Difference]: With dead ends: 79 [2022-07-13 11:13:24,740 INFO L226 Difference]: Without dead ends: 77 [2022-07-13 11:13:24,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=214, Invalid=1195, Unknown=1, NotChecked=72, Total=1482 [2022-07-13 11:13:24,741 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:13:24,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 133 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 115 Invalid, 0 Unknown, 198 Unchecked, 0.4s Time] [2022-07-13 11:13:24,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-13 11:13:24,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2022-07-13 11:13:24,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.15625) internal successors, (74), 64 states have internal predecessors, (74), 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) [2022-07-13 11:13:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2022-07-13 11:13:24,749 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 30 [2022-07-13 11:13:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:13:24,749 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2022-07-13 11:13:24,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 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) [2022-07-13 11:13:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-07-13 11:13:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 11:13:24,750 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:13:24,750 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:13:24,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-13 11:13:24,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:13:24,958 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:13:24,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:13:24,958 INFO L85 PathProgramCache]: Analyzing trace with hash 505093188, now seen corresponding path program 5 times [2022-07-13 11:13:24,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 11:13:24,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268162373] [2022-07-13 11:13:24,959 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:13:24,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 11:13:24,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 11:13:24,960 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 11:13:24,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-13 11:13:25,433 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-07-13 11:13:25,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-13 11:13:25,433 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 11:13:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:13:25,683 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-13 11:13:25,683 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 11:13:25,684 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:13:25,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-13 11:13:25,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 11:13:25,888 INFO L356 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1] [2022-07-13 11:13:25,890 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:13:25,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:13:25 BoogieIcfgContainer [2022-07-13 11:13:25,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:13:25,928 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:13:25,928 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:13:25,928 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:13:25,928 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:13:01" (3/4) ... [2022-07-13 11:13:25,929 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 11:13:25,960 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 11:13:25,961 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:13:25,962 INFO L158 Benchmark]: Toolchain (without parser) took 25314.25ms. Allocated memory was 62.9MB in the beginning and 83.9MB in the end (delta: 21.0MB). Free memory was 42.6MB in the beginning and 47.0MB in the end (delta: -4.4MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2022-07-13 11:13:25,962 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 43.0MB in the end (delta: 28.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:13:25,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.13ms. Allocated memory is still 62.9MB. Free memory was 42.3MB in the beginning and 44.4MB in the end (delta: -2.1MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2022-07-13 11:13:25,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.32ms. Allocated memory is still 62.9MB. Free memory was 44.4MB in the beginning and 42.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:13:25,962 INFO L158 Benchmark]: Boogie Preprocessor took 38.20ms. Allocated memory is still 62.9MB. Free memory was 42.6MB in the beginning and 41.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:13:25,963 INFO L158 Benchmark]: RCFGBuilder took 298.54ms. Allocated memory is still 62.9MB. Free memory was 41.2MB in the beginning and 28.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 11:13:25,963 INFO L158 Benchmark]: TraceAbstraction took 24664.92ms. Allocated memory was 62.9MB in the beginning and 83.9MB in the end (delta: 21.0MB). Free memory was 27.7MB in the beginning and 50.4MB in the end (delta: -22.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:13:25,963 INFO L158 Benchmark]: Witness Printer took 33.57ms. Allocated memory is still 83.9MB. Free memory was 50.4MB in the beginning and 47.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 11:13:25,964 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.10ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 43.0MB in the end (delta: 28.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.13ms. Allocated memory is still 62.9MB. Free memory was 42.3MB in the beginning and 44.4MB in the end (delta: -2.1MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.32ms. Allocated memory is still 62.9MB. Free memory was 44.4MB in the beginning and 42.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.20ms. Allocated memory is still 62.9MB. Free memory was 42.6MB in the beginning and 41.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 298.54ms. Allocated memory is still 62.9MB. Free memory was 41.2MB in the beginning and 28.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 24664.92ms. Allocated memory was 62.9MB in the beginning and 83.9MB in the end (delta: 21.0MB). Free memory was 27.7MB in the beginning and 50.4MB in the end (delta: -22.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 33.57ms. Allocated memory is still 83.9MB. Free memory was 50.4MB in the beginning and 47.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. 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: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int N; VAL [N=0] [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, N=3] [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] int i; [L28] long long *a = malloc(sizeof(long long)*N); [L29] long long *b = malloc(sizeof(long long)*N); [L30] long long *c = malloc(sizeof(long long)*N); [L32] a[0] = 6 [L33] b[0] = 1 [L34] c[0] = 0 [L36] i=1 VAL [a={10:0}, b={6:0}, c={11:0}, i=1, N=3] [L36] COND TRUE i