./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound20.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 97fbca6e87e25b4f87eb503f3dd8cdf02cc5219f6d8160a4d7fb4354cdd218ca --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 04:04:06,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 04:04:06,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 04:04:06,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 04:04:06,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 04:04:06,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 04:04:06,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 04:04:06,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 04:04:06,812 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 04:04:06,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 04:04:06,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 04:04:06,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 04:04:06,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 04:04:06,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 04:04:06,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 04:04:06,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 04:04:06,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 04:04:06,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 04:04:06,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 04:04:06,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 04:04:06,831 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 04:04:06,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 04:04:06,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 04:04:06,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 04:04:06,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 04:04:06,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 04:04:06,836 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 04:04:06,836 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 04:04:06,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 04:04:06,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 04:04:06,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 04:04:06,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 04:04:06,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 04:04:06,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 04:04:06,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 04:04:06,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 04:04:06,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 04:04:06,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 04:04:06,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 04:04:06,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 04:04:06,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 04:04:06,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 04:04:06,846 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 04:04:06,864 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 04:04:06,865 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 04:04:06,865 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 04:04:06,865 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 04:04:06,866 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 04:04:06,866 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 04:04:06,866 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 04:04:06,866 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 04:04:06,867 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 04:04:06,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 04:04:06,867 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 04:04:06,867 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 04:04:06,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 04:04:06,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 04:04:06,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 04:04:06,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 04:04:06,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 04:04:06,868 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 04:04:06,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 04:04:06,869 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 04:04:06,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 04:04:06,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 04:04:06,869 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 04:04:06,869 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 04:04:06,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 04:04:06,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 04:04:06,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 04:04:06,870 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 04:04:06,870 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 04:04:06,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 04:04:06,870 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 04:04:06,870 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 04:04:06,871 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 04:04:06,871 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 -> 97fbca6e87e25b4f87eb503f3dd8cdf02cc5219f6d8160a4d7fb4354cdd218ca [2022-07-21 04:04:07,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 04:04:07,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 04:04:07,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 04:04:07,155 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 04:04:07,155 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 04:04:07,156 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound20.c [2022-07-21 04:04:07,226 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ae4f178/7df19f0816fa480cb7a384f581d2cbd2/FLAG6bd12850a [2022-07-21 04:04:07,568 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 04:04:07,569 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound20.c [2022-07-21 04:04:07,574 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ae4f178/7df19f0816fa480cb7a384f581d2cbd2/FLAG6bd12850a [2022-07-21 04:04:07,973 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ae4f178/7df19f0816fa480cb7a384f581d2cbd2 [2022-07-21 04:04:07,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 04:04:07,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 04:04:07,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 04:04:07,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 04:04:07,980 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 04:04:07,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:04:07" (1/1) ... [2022-07-21 04:04:07,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113855ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:04:07, skipping insertion in model container [2022-07-21 04:04:07,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:04:07" (1/1) ... [2022-07-21 04:04:07,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 04:04:07,995 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 04:04:08,072 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/nla-digbench-scaling/prod4br-ll_unwindbound20.c[524,537] [2022-07-21 04:04:08,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 04:04:08,087 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 04:04:08,094 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/nla-digbench-scaling/prod4br-ll_unwindbound20.c[524,537] [2022-07-21 04:04:08,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 04:04:08,137 INFO L208 MainTranslator]: Completed translation [2022-07-21 04:04:08,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:04:08 WrapperNode [2022-07-21 04:04:08,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 04:04:08,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 04:04:08,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 04:04:08,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 04:04:08,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:04:08" (1/1) ... [2022-07-21 04:04:08,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:04:08" (1/1) ... [2022-07-21 04:04:08,177 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2022-07-21 04:04:08,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 04:04:08,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 04:04:08,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 04:04:08,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 04:04:08,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:04:08" (1/1) ... [2022-07-21 04:04:08,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:04:08" (1/1) ... [2022-07-21 04:04:08,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:04:08" (1/1) ... [2022-07-21 04:04:08,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:04:08" (1/1) ... [2022-07-21 04:04:08,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:04:08" (1/1) ... [2022-07-21 04:04:08,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:04:08" (1/1) ... [2022-07-21 04:04:08,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:04:08" (1/1) ... [2022-07-21 04:04:08,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 04:04:08,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 04:04:08,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 04:04:08,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 04:04:08,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:04:08" (1/1) ... [2022-07-21 04:04:08,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 04:04:08,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:04:08,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 04:04:08,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 04:04:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 04:04:08,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 04:04:08,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 04:04:08,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 04:04:08,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 04:04:08,347 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 04:04:08,393 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 04:04:08,394 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 04:04:08,523 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 04:04:08,527 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 04:04:08,527 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 04:04:08,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:04:08 BoogieIcfgContainer [2022-07-21 04:04:08,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 04:04:08,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 04:04:08,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 04:04:08,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 04:04:08,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 04:04:07" (1/3) ... [2022-07-21 04:04:08,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0f4372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:04:08, skipping insertion in model container [2022-07-21 04:04:08,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:04:08" (2/3) ... [2022-07-21 04:04:08,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0f4372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:04:08, skipping insertion in model container [2022-07-21 04:04:08,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:04:08" (3/3) ... [2022-07-21 04:04:08,533 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_unwindbound20.c [2022-07-21 04:04:08,550 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 04:04:08,550 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 04:04:08,578 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 04:04:08,583 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@419de9d5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4e351e25 [2022-07-21 04:04:08,583 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 04:04:08,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 04:04:08,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 04:04:08,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:04:08,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:04:08,593 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:04:08,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:04:08,597 INFO L85 PathProgramCache]: Analyzing trace with hash -563977895, now seen corresponding path program 1 times [2022-07-21 04:04:08,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:04:08,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547417447] [2022-07-21 04:04:08,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:08,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:04:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 04:04:08,739 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-21 04:04:08,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:04:08,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547417447] [2022-07-21 04:04:08,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547417447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 04:04:08,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 04:04:08,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 04:04:08,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166251220] [2022-07-21 04:04:08,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 04:04:08,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 04:04:08,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:04:08,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 04:04:08,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 04:04:08,773 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 04:04:08,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:04:08,788 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2022-07-21 04:04:08,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 04:04:08,790 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-21 04:04:08,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:04:08,797 INFO L225 Difference]: With dead ends: 43 [2022-07-21 04:04:08,797 INFO L226 Difference]: Without dead ends: 19 [2022-07-21 04:04:08,800 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-21 04:04:08,803 INFO L413 NwaCegarLoop]: 29 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, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 04:04:08,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 04:04:08,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-21 04:04:08,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-21 04:04:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 04:04:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-07-21 04:04:08,841 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 9 [2022-07-21 04:04:08,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:04:08,841 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-07-21 04:04:08,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 04:04:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-07-21 04:04:08,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 04:04:08,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:04:08,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:04:08,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 04:04:08,844 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:04:08,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:04:08,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1986058659, now seen corresponding path program 1 times [2022-07-21 04:04:08,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:04:08,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281404306] [2022-07-21 04:04:08,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:08,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:04:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 04:04:08,943 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-21 04:04:08,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:04:08,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281404306] [2022-07-21 04:04:08,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281404306] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 04:04:08,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 04:04:08,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 04:04:08,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717750892] [2022-07-21 04:04:08,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 04:04:08,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 04:04:08,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:04:08,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 04:04:08,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 04:04:08,947 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 04:04:08,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:04:08,969 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-07-21 04:04:08,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 04:04:08,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-21 04:04:08,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:04:08,971 INFO L225 Difference]: With dead ends: 29 [2022-07-21 04:04:08,971 INFO L226 Difference]: Without dead ends: 21 [2022-07-21 04:04:08,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 04:04:08,973 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 04:04:08,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 04:04:08,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-21 04:04:08,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-21 04:04:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 04:04:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-07-21 04:04:08,981 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 10 [2022-07-21 04:04:08,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:04:08,981 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-07-21 04:04:08,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 04:04:08,982 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-07-21 04:04:08,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 04:04:08,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:04:08,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:04:08,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 04:04:08,984 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:04:08,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:04:08,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1984271199, now seen corresponding path program 1 times [2022-07-21 04:04:08,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:04:08,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058799914] [2022-07-21 04:04:08,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:08,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:04:08,995 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 04:04:08,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [871937577] [2022-07-21 04:04:08,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:08,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:04:08,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:04:09,012 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 04:04:09,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 04:04:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 04:04:09,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 04:04:09,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 04:04:09,119 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-21 04:04:09,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 04:04:09,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:04:09,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058799914] [2022-07-21 04:04:09,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 04:04:09,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871937577] [2022-07-21 04:04:09,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871937577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 04:04:09,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 04:04:09,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 04:04:09,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386430675] [2022-07-21 04:04:09,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 04:04:09,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 04:04:09,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:04:09,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 04:04:09,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 04:04:09,122 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 04:04:09,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:04:09,196 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-07-21 04:04:09,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 04:04:09,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-21 04:04:09,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:04:09,197 INFO L225 Difference]: With dead ends: 34 [2022-07-21 04:04:09,197 INFO L226 Difference]: Without dead ends: 32 [2022-07-21 04:04:09,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 04:04:09,199 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 04:04:09,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 52 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 04:04:09,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-21 04:04:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2022-07-21 04:04:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 04:04:09,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-07-21 04:04:09,205 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 10 [2022-07-21 04:04:09,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:04:09,205 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-21 04:04:09,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 04:04:09,205 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-07-21 04:04:09,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 04:04:09,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:04:09,206 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:04:09,225 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-21 04:04:09,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:04:09,425 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:04:09,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:04:09,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1194524114, now seen corresponding path program 1 times [2022-07-21 04:04:09,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:04:09,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483199261] [2022-07-21 04:04:09,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:09,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:04:09,433 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 04:04:09,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2002359277] [2022-07-21 04:04:09,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:09,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:04:09,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:04:09,453 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 04:04:09,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 04:04:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 04:04:09,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 04:04:09,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 04:04:09,789 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-21 04:04:09,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 04:04:10,008 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-21 04:04:10,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:04:10,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483199261] [2022-07-21 04:04:10,008 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 04:04:10,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002359277] [2022-07-21 04:04:10,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002359277] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 04:04:10,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 04:04:10,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2022-07-21 04:04:10,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564521595] [2022-07-21 04:04:10,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 04:04:10,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 04:04:10,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:04:10,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 04:04:10,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-21 04:04:10,010 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 04:04:10,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:04:10,363 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-07-21 04:04:10,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 04:04:10,364 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-07-21 04:04:10,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:04:10,366 INFO L225 Difference]: With dead ends: 47 [2022-07-21 04:04:10,366 INFO L226 Difference]: Without dead ends: 45 [2022-07-21 04:04:10,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2022-07-21 04:04:10,368 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 04:04:10,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 83 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 04:04:10,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-21 04:04:10,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2022-07-21 04:04:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 04:04:10,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-07-21 04:04:10,374 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 16 [2022-07-21 04:04:10,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:04:10,375 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-07-21 04:04:10,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 04:04:10,375 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-07-21 04:04:10,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 04:04:10,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:04:10,376 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:04:10,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 04:04:10,590 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,SelfDestructingSolverStorable3 [2022-07-21 04:04:10,591 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:04:10,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:04:10,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1756733383, now seen corresponding path program 1 times [2022-07-21 04:04:10,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:04:10,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128248436] [2022-07-21 04:04:10,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:10,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:04:10,601 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 04:04:10,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [380623513] [2022-07-21 04:04:10,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:10,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:04:10,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:04:10,605 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-21 04:04:10,635 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-21 04:04:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 04:04:10,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 04:04:10,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 04:04:10,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 04:04:10,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 04:04:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 04:04:10,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:04:10,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128248436] [2022-07-21 04:04:10,695 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 04:04:10,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380623513] [2022-07-21 04:04:10,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380623513] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 04:04:10,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 04:04:10,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-07-21 04:04:10,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401065068] [2022-07-21 04:04:10,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 04:04:10,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 04:04:10,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:04:10,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 04:04:10,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-21 04:04:10,697 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 04:04:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:04:10,788 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2022-07-21 04:04:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 04:04:10,789 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-07-21 04:04:10,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:04:10,790 INFO L225 Difference]: With dead ends: 95 [2022-07-21 04:04:10,790 INFO L226 Difference]: Without dead ends: 85 [2022-07-21 04:04:10,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-21 04:04:10,791 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 52 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 04:04:10,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 124 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 04:04:10,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-21 04:04:10,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2022-07-21 04:04:10,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 61 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-21 04:04:10,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2022-07-21 04:04:10,803 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 19 [2022-07-21 04:04:10,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:04:10,803 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2022-07-21 04:04:10,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 04:04:10,803 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2022-07-21 04:04:10,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 04:04:10,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:04:10,804 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:04:10,837 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-21 04:04:11,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:04:11,020 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:04:11,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:04:11,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1754945923, now seen corresponding path program 1 times [2022-07-21 04:04:11,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:04:11,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276875758] [2022-07-21 04:04:11,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:11,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:04:11,027 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 04:04:11,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [335284100] [2022-07-21 04:04:11,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:11,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:04:11,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:04:11,036 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-21 04:04:11,039 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-21 04:04:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 04:04:11,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-21 04:04:11,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 04:04:12,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 04:04:12,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 04:04:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 04:04:12,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:04:12,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276875758] [2022-07-21 04:04:12,734 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 04:04:12,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335284100] [2022-07-21 04:04:12,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335284100] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 04:04:12,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 04:04:12,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-07-21 04:04:12,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032397778] [2022-07-21 04:04:12,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 04:04:12,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 04:04:12,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:04:12,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 04:04:12,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-21 04:04:12,736 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 04:04:13,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:04:13,992 INFO L93 Difference]: Finished difference Result 120 states and 157 transitions. [2022-07-21 04:04:13,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 04:04:13,992 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-07-21 04:04:13,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:04:13,993 INFO L225 Difference]: With dead ends: 120 [2022-07-21 04:04:13,994 INFO L226 Difference]: Without dead ends: 114 [2022-07-21 04:04:13,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-07-21 04:04:13,994 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 104 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 04:04:13,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 80 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 04:04:13,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-21 04:04:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 71. [2022-07-21 04:04:14,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 56 states have internal predecessors, (72), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-21 04:04:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2022-07-21 04:04:14,005 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 19 [2022-07-21 04:04:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:04:14,006 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2022-07-21 04:04:14,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 04:04:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2022-07-21 04:04:14,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 04:04:14,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:04:14,007 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:04:14,041 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-21 04:04:14,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:04:14,224 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:04:14,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:04:14,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1942139802, now seen corresponding path program 1 times [2022-07-21 04:04:14,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:04:14,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193855300] [2022-07-21 04:04:14,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:14,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:04:14,231 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 04:04:14,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1070661427] [2022-07-21 04:04:14,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:14,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:04:14,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:04:14,233 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-21 04:04:14,234 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-21 04:04:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 04:04:14,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 04:04:14,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 04:04:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 04:04:14,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 04:04:14,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:04:14,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193855300] [2022-07-21 04:04:14,302 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 04:04:14,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070661427] [2022-07-21 04:04:14,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070661427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 04:04:14,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 04:04:14,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 04:04:14,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896229441] [2022-07-21 04:04:14,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 04:04:14,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 04:04:14,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:04:14,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 04:04:14,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 04:04:14,304 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 04:04:14,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:04:14,420 INFO L93 Difference]: Finished difference Result 108 states and 143 transitions. [2022-07-21 04:04:14,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 04:04:14,420 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-07-21 04:04:14,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:04:14,424 INFO L225 Difference]: With dead ends: 108 [2022-07-21 04:04:14,424 INFO L226 Difference]: Without dead ends: 96 [2022-07-21 04:04:14,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-21 04:04:14,427 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 04:04:14,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 83 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 04:04:14,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-21 04:04:14,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2022-07-21 04:04:14,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 73 states have internal predecessors, (95), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-21 04:04:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2022-07-21 04:04:14,446 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 21 [2022-07-21 04:04:14,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:04:14,446 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2022-07-21 04:04:14,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 04:04:14,447 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2022-07-21 04:04:14,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 04:04:14,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:04:14,448 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:04:14,467 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-21 04:04:14,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:04:14,665 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:04:14,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:04:14,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1954557947, now seen corresponding path program 1 times [2022-07-21 04:04:14,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:04:14,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385536241] [2022-07-21 04:04:14,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:14,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:04:14,678 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 04:04:14,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1409423715] [2022-07-21 04:04:14,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:14,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:04:14,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:04:14,684 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-21 04:04:14,685 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-21 04:04:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 04:04:14,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 04:04:14,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 04:04:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 04:04:14,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 04:04:14,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:04:14,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385536241] [2022-07-21 04:04:14,740 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 04:04:14,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409423715] [2022-07-21 04:04:14,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409423715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 04:04:14,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 04:04:14,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 04:04:14,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143711890] [2022-07-21 04:04:14,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 04:04:14,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 04:04:14,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:04:14,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 04:04:14,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 04:04:14,742 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 04:04:14,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:04:14,789 INFO L93 Difference]: Finished difference Result 133 states and 172 transitions. [2022-07-21 04:04:14,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 04:04:14,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-07-21 04:04:14,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:04:14,791 INFO L225 Difference]: With dead ends: 133 [2022-07-21 04:04:14,791 INFO L226 Difference]: Without dead ends: 121 [2022-07-21 04:04:14,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 04:04:14,792 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 04:04:14,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 04:04:14,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-21 04:04:14,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 105. [2022-07-21 04:04:14,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 84 states have internal predecessors, (107), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-21 04:04:14,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2022-07-21 04:04:14,804 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 32 [2022-07-21 04:04:14,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:04:14,804 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2022-07-21 04:04:14,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 04:04:14,805 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2022-07-21 04:04:14,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 04:04:14,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:04:14,806 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:04:14,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-21 04:04:15,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:04:15,027 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:04:15,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:04:15,027 INFO L85 PathProgramCache]: Analyzing trace with hash 346264643, now seen corresponding path program 1 times [2022-07-21 04:04:15,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:04:15,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192063457] [2022-07-21 04:04:15,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:15,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:04:15,033 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 04:04:15,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2142333186] [2022-07-21 04:04:15,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:15,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:04:15,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:04:15,035 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-21 04:04:15,056 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-21 04:04:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 04:04:15,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 04:04:15,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 04:04:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 04:04:15,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 04:04:15,202 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 04:04:15,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:04:15,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192063457] [2022-07-21 04:04:15,202 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 04:04:15,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142333186] [2022-07-21 04:04:15,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142333186] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-21 04:04:15,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 04:04:15,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-07-21 04:04:15,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748256839] [2022-07-21 04:04:15,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 04:04:15,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 04:04:15,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:04:15,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 04:04:15,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-21 04:04:15,204 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 04:04:15,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:04:15,412 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2022-07-21 04:04:15,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 04:04:15,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-07-21 04:04:15,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:04:15,417 INFO L225 Difference]: With dead ends: 112 [2022-07-21 04:04:15,417 INFO L226 Difference]: Without dead ends: 92 [2022-07-21 04:04:15,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-21 04:04:15,418 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 04:04:15,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 90 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 04:04:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-21 04:04:15,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 58. [2022-07-21 04:04:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-21 04:04:15,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2022-07-21 04:04:15,433 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 32 [2022-07-21 04:04:15,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:04:15,434 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2022-07-21 04:04:15,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 04:04:15,434 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-07-21 04:04:15,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 04:04:15,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:04:15,435 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:04:15,452 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-21 04:04:15,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:04:15,651 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:04:15,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:04:15,652 INFO L85 PathProgramCache]: Analyzing trace with hash 136508765, now seen corresponding path program 2 times [2022-07-21 04:04:15,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:04:15,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762432190] [2022-07-21 04:04:15,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:15,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:04:15,660 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 04:04:15,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [831730455] [2022-07-21 04:04:15,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 04:04:15,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:04:15,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:04:15,672 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-21 04:04:15,673 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-21 04:04:15,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 04:04:15,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 04:04:15,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 04:04:15,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 04:04:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 04:04:15,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 04:04:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-21 04:04:15,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:04:15,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762432190] [2022-07-21 04:04:15,849 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 04:04:15,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831730455] [2022-07-21 04:04:15,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831730455] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 04:04:15,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 04:04:15,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-07-21 04:04:15,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816471174] [2022-07-21 04:04:15,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 04:04:15,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 04:04:15,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:04:15,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 04:04:15,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-21 04:04:15,850 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 04:04:15,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:04:15,971 INFO L93 Difference]: Finished difference Result 132 states and 169 transitions. [2022-07-21 04:04:15,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 04:04:15,972 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 46 [2022-07-21 04:04:15,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:04:15,973 INFO L225 Difference]: With dead ends: 132 [2022-07-21 04:04:15,973 INFO L226 Difference]: Without dead ends: 124 [2022-07-21 04:04:15,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-07-21 04:04:15,974 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 129 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 04:04:15,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 196 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 04:04:15,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-21 04:04:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-21 04:04:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.32) internal successors, (132), 101 states have internal predecessors, (132), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-21 04:04:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 155 transitions. [2022-07-21 04:04:15,998 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 155 transitions. Word has length 46 [2022-07-21 04:04:15,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:04:15,998 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 155 transitions. [2022-07-21 04:04:15,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 04:04:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2022-07-21 04:04:16,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-21 04:04:16,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:04:16,001 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:04:16,032 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-21 04:04:16,233 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,SelfDestructingSolverStorable9 [2022-07-21 04:04:16,233 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:04:16,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:04:16,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1689445411, now seen corresponding path program 3 times [2022-07-21 04:04:16,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:04:16,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316075173] [2022-07-21 04:04:16,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:16,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:04:16,242 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 04:04:16,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1171089982] [2022-07-21 04:04:16,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 04:04:16,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:04:16,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:04:16,257 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-21 04:04:16,260 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-21 04:04:16,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-21 04:04:16,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 04:04:16,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 04:04:16,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 04:04:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 04:04:16,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 04:04:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-21 04:04:16,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:04:16,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316075173] [2022-07-21 04:04:16,797 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 04:04:16,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171089982] [2022-07-21 04:04:16,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171089982] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 04:04:16,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 04:04:16,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2022-07-21 04:04:16,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083812454] [2022-07-21 04:04:16,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 04:04:16,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 04:04:16,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:04:16,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 04:04:16,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-07-21 04:04:16,800 INFO L87 Difference]: Start difference. First operand 124 states and 155 transitions. Second operand has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-07-21 04:04:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:04:17,174 INFO L93 Difference]: Finished difference Result 242 states and 313 transitions. [2022-07-21 04:04:17,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-21 04:04:17,174 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 100 [2022-07-21 04:04:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:04:17,176 INFO L225 Difference]: With dead ends: 242 [2022-07-21 04:04:17,176 INFO L226 Difference]: Without dead ends: 234 [2022-07-21 04:04:17,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-07-21 04:04:17,177 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 440 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 04:04:17,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 302 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 04:04:17,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-21 04:04:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-07-21 04:04:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 190 states have (on average 1.3263157894736841) internal successors, (252), 191 states have internal predecessors, (252), 22 states have call successors, (22), 21 states have call predecessors, (22), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-21 04:04:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 295 transitions. [2022-07-21 04:04:17,192 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 295 transitions. Word has length 100 [2022-07-21 04:04:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:04:17,193 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 295 transitions. [2022-07-21 04:04:17,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2022-07-21 04:04:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 295 transitions. [2022-07-21 04:04:17,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-21 04:04:17,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:04:17,194 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:04:17,200 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-21 04:04:17,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:04:17,400 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:04:17,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:04:17,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1595985571, now seen corresponding path program 4 times [2022-07-21 04:04:17,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:04:17,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19150477] [2022-07-21 04:04:17,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:17,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:04:17,418 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 04:04:17,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1155610045] [2022-07-21 04:04:17,419 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 04:04:17,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:04:17,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:04:17,420 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-21 04:04:17,422 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-21 04:04:17,647 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 04:04:17,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-21 04:04:17,648 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 04:04:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 04:04:17,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 04:04:17,835 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 04:04:17,836 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 04:04:17,858 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-21 04:04:18,056 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,SelfDestructingSolverStorable11 [2022-07-21 04:04:18,058 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:04:18,061 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 04:04:18,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 04:04:18 BoogieIcfgContainer [2022-07-21 04:04:18,130 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 04:04:18,131 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 04:04:18,131 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 04:04:18,131 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 04:04:18,131 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:04:08" (3/4) ... [2022-07-21 04:04:18,132 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 04:04:18,230 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 04:04:18,231 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 04:04:18,231 INFO L158 Benchmark]: Toolchain (without parser) took 10255.31ms. Allocated memory was 67.1MB in the beginning and 123.7MB in the end (delta: 56.6MB). Free memory was 48.9MB in the beginning and 103.9MB in the end (delta: -54.9MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. [2022-07-21 04:04:18,232 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 67.1MB. Free memory was 50.1MB in the beginning and 50.0MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 04:04:18,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.10ms. Allocated memory is still 67.1MB. Free memory was 48.7MB in the beginning and 52.0MB in the end (delta: -3.3MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2022-07-21 04:04:18,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.72ms. Allocated memory is still 67.1MB. Free memory was 52.0MB in the beginning and 50.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 04:04:18,233 INFO L158 Benchmark]: Boogie Preprocessor took 26.44ms. Allocated memory is still 67.1MB. Free memory was 50.3MB in the beginning and 49.3MB in the end (delta: 980.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 04:04:18,233 INFO L158 Benchmark]: RCFGBuilder took 323.45ms. Allocated memory is still 67.1MB. Free memory was 49.1MB in the beginning and 38.8MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 04:04:18,233 INFO L158 Benchmark]: TraceAbstraction took 9601.22ms. Allocated memory was 67.1MB in the beginning and 123.7MB in the end (delta: 56.6MB). Free memory was 38.4MB in the beginning and 42.8MB in the end (delta: -4.4MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. [2022-07-21 04:04:18,234 INFO L158 Benchmark]: Witness Printer took 99.93ms. Allocated memory is still 123.7MB. Free memory was 42.8MB in the beginning and 103.9MB in the end (delta: -61.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 04:04:18,236 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.72ms. Allocated memory is still 67.1MB. Free memory was 50.1MB in the beginning and 50.0MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.10ms. Allocated memory is still 67.1MB. Free memory was 48.7MB in the beginning and 52.0MB in the end (delta: -3.3MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.72ms. Allocated memory is still 67.1MB. Free memory was 52.0MB in the beginning and 50.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.44ms. Allocated memory is still 67.1MB. Free memory was 50.3MB in the beginning and 49.3MB in the end (delta: 980.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 323.45ms. Allocated memory is still 67.1MB. Free memory was 49.1MB in the beginning and 38.8MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9601.22ms. Allocated memory was 67.1MB in the beginning and 123.7MB in the end (delta: 56.6MB). Free memory was 38.4MB in the beginning and 42.8MB in the end (delta: -4.4MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. * Witness Printer took 99.93ms. Allocated memory is still 123.7MB. Free memory was 42.8MB in the beginning and 103.9MB in the end (delta: -61.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int x, y; [L22] long long a, b, p, q; [L24] x = __VERIFIER_nondet_int() [L25] y = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(y >= 1) [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L26] RET assume_abort_if_not(y >= 1) [L28] a = x [L29] b = y [L30] p = 1 [L31] q = 0 VAL [a=1048576, b=2097152, counter=0, p=1, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=1048576, b=2097152, counter=1, counter++=0, p=1, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=1048576, b=2097152, counter=1, p=1, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=1048576, b=2097152, counter=1, p=1, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=524288, b=1048576, counter=1, p=4, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=524288, b=1048576, counter=2, counter++=1, p=4, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=524288, b=1048576, counter=2, p=4, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=524288, b=1048576, counter=2, p=4, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=262144, b=524288, counter=2, p=16, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=262144, b=524288, counter=3, counter++=2, p=16, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=262144, b=524288, counter=3, p=16, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=262144, b=524288, counter=3, p=16, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=131072, b=262144, counter=3, p=64, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=131072, b=262144, counter=4, counter++=3, p=64, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=131072, b=262144, counter=4, p=64, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=131072, b=262144, counter=4, p=64, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=65536, b=131072, counter=4, p=256, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=65536, b=131072, counter=5, counter++=4, p=256, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=65536, b=131072, counter=5, p=256, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=65536, b=131072, counter=5, p=256, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=32768, b=65536, counter=5, p=1024, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=32768, b=65536, counter=6, counter++=5, p=1024, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=32768, b=65536, counter=6, p=1024, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=32768, b=65536, counter=6, p=1024, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=16384, b=32768, counter=6, p=4096, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=16384, b=32768, counter=7, counter++=6, p=4096, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=16384, b=32768, counter=7, p=4096, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=16384, b=32768, counter=7, p=4096, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=8192, b=16384, counter=7, p=16384, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=8192, b=16384, counter=8, counter++=7, p=16384, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=8192, b=16384, counter=8, p=16384, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=8192, b=16384, counter=8, p=16384, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=4096, b=8192, counter=8, p=65536, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=4096, b=8192, counter=9, counter++=8, p=65536, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=4096, b=8192, counter=9, p=65536, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=4096, b=8192, counter=9, p=65536, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=2048, b=4096, counter=9, p=262144, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=2048, b=4096, counter=10, counter++=9, p=262144, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=2048, b=4096, counter=10, p=262144, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=2048, b=4096, counter=10, p=262144, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=1024, b=2048, counter=10, p=1048576, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=1024, b=2048, counter=11, counter++=10, p=1048576, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=1024, b=2048, counter=11, p=1048576, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=1024, b=2048, counter=11, p=1048576, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=512, b=1024, counter=11, p=4194304, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=512, b=1024, counter=12, counter++=11, p=4194304, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=512, b=1024, counter=12, p=4194304, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=512, b=1024, counter=12, p=4194304, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=256, b=512, counter=12, p=16777216, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=256, b=512, counter=13, counter++=12, p=16777216, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=256, b=512, counter=13, p=16777216, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=256, b=512, counter=13, p=16777216, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=128, b=256, counter=13, p=67108864, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=128, b=256, counter=14, counter++=13, p=67108864, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=128, b=256, counter=14, p=67108864, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=128, b=256, counter=14, p=67108864, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=64, b=128, counter=14, p=268435456, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=64, b=128, counter=15, counter++=14, p=268435456, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=64, b=128, counter=15, p=268435456, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=64, b=128, counter=15, p=268435456, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=32, b=64, counter=15, p=1073741824, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=32, b=64, counter=16, counter++=15, p=1073741824, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=32, b=64, counter=16, p=1073741824, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=32, b=64, counter=16, p=1073741824, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=16, b=32, counter=16, p=4294967296, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=16, b=32, counter=17, counter++=16, p=4294967296, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=16, b=32, counter=17, p=4294967296, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=16, b=32, counter=17, p=4294967296, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=8, b=16, counter=17, p=17179869184, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=8, b=16, counter=18, counter++=17, p=17179869184, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=8, b=16, counter=18, p=17179869184, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=8, b=16, counter=18, p=17179869184, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=4, b=8, counter=18, p=68719476736, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=4, b=8, counter=19, counter++=18, p=68719476736, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=4, b=8, counter=19, p=68719476736, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=4, b=8, counter=19, p=68719476736, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=2, b=4, counter=19, p=274877906944, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=2, b=4, counter=20, counter++=19, p=274877906944, q=0, x=1048576, y=2097152] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=2, b=4, counter=20, p=274877906944, q=0, x=1048576, y=2097152] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=2, b=4, counter=20, p=274877906944, q=0, x=1048576, y=2097152] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=1, b=2, counter=20, p=1099511627776, q=0, x=1048576, y=2097152] [L33] EXPR counter++ VAL [a=1, b=2, counter=21, counter++=20, p=1099511627776, q=0, x=1048576, y=2097152] [L33] COND FALSE !(counter++<20) [L56] CALL __VERIFIER_assert(q == (long long) x * y) VAL [\old(cond)=0, counter=21] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L14] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 12, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 862 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 859 mSDsluCounter, 1186 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 906 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 800 IncrementalHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 280 mSDtfsCounter, 800 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 573 GetRequests, 432 SyntacticMatches, 4 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=11, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 124 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 529 ConstructedInterpolants, 0 QuantifiedInterpolants, 1895 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1056 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 340/1126 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-21 04:04:18,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE