./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/cohencu-ll_unwindbound1.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 6b537bfce1176c41c6bc215444effcd63b1e343cf1b15ee69a282ebedb146c69 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:14:05,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:14:05,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:14:05,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:14:05,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:14:05,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:14:05,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:14:05,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:14:05,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:14:05,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:14:05,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:14:05,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:14:05,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:14:05,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:14:05,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:14:05,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:14:05,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:14:05,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:14:05,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:14:05,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:14:05,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:14:05,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:14:05,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:14:05,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:14:05,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:14:05,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:14:05,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:14:05,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:14:05,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:14:05,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:14:05,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:14:05,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:14:05,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:14:05,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:14:05,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:14:05,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:14:05,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:14:05,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:14:05,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:14:05,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:14:05,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:14:05,303 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:14:05,326 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:14:05,327 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:14:05,327 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:14:05,327 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:14:05,328 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:14:05,328 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:14:05,329 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:14:05,329 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:14:05,329 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:14:05,329 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:14:05,330 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:14:05,330 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:14:05,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:14:05,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:14:05,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:14:05,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:14:05,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:14:05,341 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:14:05,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:14:05,341 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:14:05,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:14:05,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:14:05,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:14:05,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:14:05,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:14:05,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:14:05,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:14:05,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:14:05,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:14:05,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:14:05,344 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:14:05,344 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:14:05,344 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:14:05,344 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 -> 6b537bfce1176c41c6bc215444effcd63b1e343cf1b15ee69a282ebedb146c69 [2022-02-20 17:14:05,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:14:05,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:14:05,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:14:05,573 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:14:05,573 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:14:05,574 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound1.c [2022-02-20 17:14:05,618 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb0a8206b/9b303c359ccd4380a02358a3a8e812b1/FLAG689355941 [2022-02-20 17:14:06,035 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:14:06,037 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound1.c [2022-02-20 17:14:06,045 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb0a8206b/9b303c359ccd4380a02358a3a8e812b1/FLAG689355941 [2022-02-20 17:14:06,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb0a8206b/9b303c359ccd4380a02358a3a8e812b1 [2022-02-20 17:14:06,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:14:06,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:14:06,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:14:06,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:14:06,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:14:06,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:14:06" (1/1) ... [2022-02-20 17:14:06,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6458db81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:06, skipping insertion in model container [2022-02-20 17:14:06,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:14:06" (1/1) ... [2022-02-20 17:14:06,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:14:06,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:14:06,240 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/cohencu-ll_unwindbound1.c[588,601] [2022-02-20 17:14:06,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:14:06,271 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:14:06,280 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/cohencu-ll_unwindbound1.c[588,601] [2022-02-20 17:14:06,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:14:06,302 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:14:06,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:06 WrapperNode [2022-02-20 17:14:06,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:14:06,304 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:14:06,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:14:06,304 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:14:06,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:06" (1/1) ... [2022-02-20 17:14:06,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:06" (1/1) ... [2022-02-20 17:14:06,344 INFO L137 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2022-02-20 17:14:06,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:14:06,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:14:06,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:14:06,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:14:06,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:06" (1/1) ... [2022-02-20 17:14:06,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:06" (1/1) ... [2022-02-20 17:14:06,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:06" (1/1) ... [2022-02-20 17:14:06,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:06" (1/1) ... [2022-02-20 17:14:06,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:06" (1/1) ... [2022-02-20 17:14:06,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:06" (1/1) ... [2022-02-20 17:14:06,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:06" (1/1) ... [2022-02-20 17:14:06,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:14:06,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:14:06,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:14:06,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:14:06,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:06" (1/1) ... [2022-02-20 17:14:06,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:14:06,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:06,400 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-02-20 17:14:06,403 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-02-20 17:14:06,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:14:06,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:14:06,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:14:06,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:14:06,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:14:06,433 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:14:06,483 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:14:06,484 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:14:06,616 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:14:06,621 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:14:06,621 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:14:06,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:14:06 BoogieIcfgContainer [2022-02-20 17:14:06,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:14:06,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:14:06,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:14:06,647 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:14:06,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:14:06" (1/3) ... [2022-02-20 17:14:06,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505a187b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:14:06, skipping insertion in model container [2022-02-20 17:14:06,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:06" (2/3) ... [2022-02-20 17:14:06,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@505a187b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:14:06, skipping insertion in model container [2022-02-20 17:14:06,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:14:06" (3/3) ... [2022-02-20 17:14:06,650 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound1.c [2022-02-20 17:14:06,654 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:14:06,663 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:14:06,700 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:14:06,707 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:14:06,708 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:14:06,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:14:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:14:06,742 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:06,743 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:06,744 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:06,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:06,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1823967074, now seen corresponding path program 1 times [2022-02-20 17:14:06,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:06,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225680684] [2022-02-20 17:14:06,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:06,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:06,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-02-20 17:14:06,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {29#true} is VALID [2022-02-20 17:14:06,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-02-20 17:14:06,937 INFO L272 TraceCheckUtils]: 3: Hoare triple {30#false} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {30#false} is VALID [2022-02-20 17:14:06,938 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-02-20 17:14:06,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-02-20 17:14:06,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 17:14:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:14:06,939 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:06,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225680684] [2022-02-20 17:14:06,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225680684] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:06,941 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:06,941 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:14:06,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406112265] [2022-02-20 17:14:06,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:06,972 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2022-02-20 17:14:06,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:06,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-20 17:14:06,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:06,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:14:06,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:07,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:14:07,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:14:07,020 INFO L87 Difference]: Start difference. First operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-20 17:14:07,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:07,129 INFO L93 Difference]: Finished difference Result 50 states and 87 transitions. [2022-02-20 17:14:07,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:14:07,130 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2022-02-20 17:14:07,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-20 17:14:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:14:07,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-20 17:14:07,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:14:07,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2022-02-20 17:14:07,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:07,264 INFO L225 Difference]: With dead ends: 50 [2022-02-20 17:14:07,265 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:14:07,267 INFO L932 BasicCegarLoop]: 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-02-20 17:14:07,270 INFO L933 BasicCegarLoop]: 37 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, 37 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-02-20 17:14:07,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:14:07,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:14:07,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 17:14:07,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:07,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:07,295 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:07,296 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:07,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:07,300 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2022-02-20 17:14:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-02-20 17:14:07,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:07,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:07,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 22 states. [2022-02-20 17:14:07,302 INFO L87 Difference]: Start difference. First operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 22 states. [2022-02-20 17:14:07,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:07,306 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2022-02-20 17:14:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-02-20 17:14:07,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:07,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:07,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:07,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2022-02-20 17:14:07,312 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 7 [2022-02-20 17:14:07,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:07,312 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2022-02-20 17:14:07,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-20 17:14:07,313 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-02-20 17:14:07,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:14:07,313 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:07,313 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:07,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:14:07,314 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:07,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:07,315 INFO L85 PathProgramCache]: Analyzing trace with hash 178926099, now seen corresponding path program 1 times [2022-02-20 17:14:07,315 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:07,315 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239541405] [2022-02-20 17:14:07,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:07,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:07,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {190#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {192#(= ~counter~0 0)} is VALID [2022-02-20 17:14:07,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {192#(= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {192#(= ~counter~0 0)} is VALID [2022-02-20 17:14:07,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {192#(= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {193#(= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-20 17:14:07,377 INFO L290 TraceCheckUtils]: 3: Hoare triple {193#(= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(main_#t~post5#1 < 1);havoc main_#t~post5#1; {191#false} is VALID [2022-02-20 17:14:07,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#false} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {191#false} is VALID [2022-02-20 17:14:07,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2022-02-20 17:14:07,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {191#false} assume 0 == ~cond; {191#false} is VALID [2022-02-20 17:14:07,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-02-20 17:14:07,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:14:07,382 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:07,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239541405] [2022-02-20 17:14:07,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239541405] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:07,383 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:07,383 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:14:07,383 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986160292] [2022-02-20 17:14:07,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:07,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2022-02-20 17:14:07,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:07,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-02-20 17:14:07,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:07,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:14:07,397 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:07,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:14:07,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:14:07,398 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-02-20 17:14:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:07,563 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-02-20 17:14:07,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:14:07,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2022-02-20 17:14:07,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:07,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-02-20 17:14:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-02-20 17:14:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-02-20 17:14:07,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-02-20 17:14:07,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-02-20 17:14:07,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:07,648 INFO L225 Difference]: With dead ends: 36 [2022-02-20 17:14:07,648 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:14:07,650 INFO L932 BasicCegarLoop]: 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-02-20 17:14:07,651 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 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-02-20 17:14:07,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:14:07,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:14:07,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:14:07,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:07,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:07,656 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:07,657 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:07,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:07,661 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-02-20 17:14:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-02-20 17:14:07,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:07,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:07,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 24 states. [2022-02-20 17:14:07,669 INFO L87 Difference]: Start difference. First operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 24 states. [2022-02-20 17:14:07,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:07,672 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-02-20 17:14:07,672 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-02-20 17:14:07,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:07,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:07,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:07,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:07,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:07,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2022-02-20 17:14:07,676 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 8 [2022-02-20 17:14:07,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:07,676 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2022-02-20 17:14:07,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-02-20 17:14:07,680 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-02-20 17:14:07,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:14:07,680 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:07,680 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:07,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:14:07,681 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:07,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:07,681 INFO L85 PathProgramCache]: Analyzing trace with hash 180475231, now seen corresponding path program 1 times [2022-02-20 17:14:07,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:07,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618472154] [2022-02-20 17:14:07,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:07,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:07,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {339#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {339#true} is VALID [2022-02-20 17:14:07,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {339#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {341#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} is VALID [2022-02-20 17:14:07,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {341#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {341#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} is VALID [2022-02-20 17:14:07,810 INFO L290 TraceCheckUtils]: 3: Hoare triple {341#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} assume !!(main_#t~post5#1 < 1);havoc main_#t~post5#1; {341#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} is VALID [2022-02-20 17:14:07,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {341#(= |ULTIMATE.start_main_~z~0#1| (+ 6 (* 6 |ULTIMATE.start_main_~n~0#1|)))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {342#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:14:07,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {342#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {343#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:14:07,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {343#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {340#false} is VALID [2022-02-20 17:14:07,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#false} assume !false; {340#false} is VALID [2022-02-20 17:14:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:14:07,812 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:07,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618472154] [2022-02-20 17:14:07,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618472154] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:07,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:07,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:14:07,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471870912] [2022-02-20 17:14:07,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:07,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2022-02-20 17:14:07,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:07,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 17:14:07,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:07,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:14:07,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:07,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:14:07,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:14:07,837 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 17:14:08,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:08,048 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-20 17:14:08,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:14:08,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2022-02-20 17:14:08,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 17:14:08,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 17:14:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 17:14:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 17:14:08,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-02-20 17:14:08,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:08,095 INFO L225 Difference]: With dead ends: 30 [2022-02-20 17:14:08,095 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:14:08,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-20 17:14:08,097 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:08,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 84 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:14:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:14:08,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 17:14:08,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:08,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:08,103 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:08,104 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:08,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:08,106 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2022-02-20 17:14:08,106 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-02-20 17:14:08,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:08,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:08,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 28 states. [2022-02-20 17:14:08,108 INFO L87 Difference]: Start difference. First operand has 28 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 28 states. [2022-02-20 17:14:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:08,110 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2022-02-20 17:14:08,110 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-02-20 17:14:08,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:08,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:08,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:08,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:08,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:08,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2022-02-20 17:14:08,113 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 8 [2022-02-20 17:14:08,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:08,113 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-02-20 17:14:08,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 17:14:08,114 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-02-20 17:14:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:14:08,114 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:08,114 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:08,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:14:08,115 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:08,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:08,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1275442234, now seen corresponding path program 1 times [2022-02-20 17:14:08,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:08,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264298323] [2022-02-20 17:14:08,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:08,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:08,130 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:08,130 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844702377] [2022-02-20 17:14:08,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:08,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:08,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:08,135 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-02-20 17:14:08,142 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-02-20 17:14:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:08,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:14:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:08,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:08,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {492#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {492#true} is VALID [2022-02-20 17:14:08,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {500#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:14:08,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {500#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {500#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:14:08,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {500#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} assume !!(main_#t~post5#1 < 1);havoc main_#t~post5#1; {500#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:14:08,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {500#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {492#true} is VALID [2022-02-20 17:14:08,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {492#true} ~cond := #in~cond; {492#true} is VALID [2022-02-20 17:14:08,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {492#true} assume !(0 == ~cond); {492#true} is VALID [2022-02-20 17:14:08,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {492#true} assume true; {492#true} is VALID [2022-02-20 17:14:08,395 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {492#true} {500#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} #48#return; {500#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 17:14:08,396 INFO L272 TraceCheckUtils]: 9: Hoare triple {500#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| 0))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:08,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:08,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {493#false} is VALID [2022-02-20 17:14:08,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {493#false} assume !false; {493#false} is VALID [2022-02-20 17:14:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:14:08,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:14:08,398 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:08,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264298323] [2022-02-20 17:14:08,398 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:14:08,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844702377] [2022-02-20 17:14:08,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844702377] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:08,399 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:08,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:14:08,399 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573975498] [2022-02-20 17:14:08,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:08,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 17:14:08,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:08,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:14:08,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:08,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:14:08,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:08,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:14:08,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:14:08,419 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:14:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:08,776 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-02-20 17:14:08,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:14:08,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 17:14:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:14:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:14:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:08,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 17:14:08,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:08,871 INFO L225 Difference]: With dead ends: 46 [2022-02-20 17:14:08,871 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 17:14:08,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-02-20 17:14:08,872 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:08,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 149 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:14:08,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 17:14:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2022-02-20 17:14:08,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:08,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:14:08,881 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:14:08,882 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:14:08,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:08,885 INFO L93 Difference]: Finished difference Result 44 states and 64 transitions. [2022-02-20 17:14:08,885 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2022-02-20 17:14:08,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:08,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:08,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 44 states. [2022-02-20 17:14:08,887 INFO L87 Difference]: Start difference. First operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 44 states. [2022-02-20 17:14:08,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:08,889 INFO L93 Difference]: Finished difference Result 44 states and 64 transitions. [2022-02-20 17:14:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2022-02-20 17:14:08,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:08,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:08,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:08,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:14:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-02-20 17:14:08,893 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 13 [2022-02-20 17:14:08,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:08,893 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-02-20 17:14:08,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:14:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-02-20 17:14:08,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:14:08,894 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:08,894 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:08,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:14:09,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:09,116 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:09,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:09,116 INFO L85 PathProgramCache]: Analyzing trace with hash 427545983, now seen corresponding path program 1 times [2022-02-20 17:14:09,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:09,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147834662] [2022-02-20 17:14:09,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:09,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:09,131 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:09,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1664533641] [2022-02-20 17:14:09,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:09,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:09,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:09,139 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-02-20 17:14:09,164 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-02-20 17:14:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:09,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:14:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:09,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:09,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {750#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {750#true} is VALID [2022-02-20 17:14:09,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {750#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:14:09,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:14:09,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_#t~post5#1 < 1);havoc main_#t~post5#1; {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:14:09,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {750#true} is VALID [2022-02-20 17:14:09,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {750#true} ~cond := #in~cond; {750#true} is VALID [2022-02-20 17:14:09,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {750#true} assume !(0 == ~cond); {750#true} is VALID [2022-02-20 17:14:09,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {750#true} assume true; {750#true} is VALID [2022-02-20 17:14:09,288 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {750#true} {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #48#return; {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:14:09,288 INFO L272 TraceCheckUtils]: 9: Hoare triple {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {750#true} is VALID [2022-02-20 17:14:09,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {750#true} ~cond := #in~cond; {750#true} is VALID [2022-02-20 17:14:09,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {750#true} assume !(0 == ~cond); {750#true} is VALID [2022-02-20 17:14:09,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {750#true} assume true; {750#true} is VALID [2022-02-20 17:14:09,289 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {750#true} {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #50#return; {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:14:09,290 INFO L272 TraceCheckUtils]: 14: Hoare triple {758#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {798#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:09,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {798#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {802#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:09,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {802#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {751#false} is VALID [2022-02-20 17:14:09,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {751#false} assume !false; {751#false} is VALID [2022-02-20 17:14:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:14:09,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:14:09,292 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:09,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147834662] [2022-02-20 17:14:09,292 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:14:09,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664533641] [2022-02-20 17:14:09,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664533641] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:09,292 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:09,293 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:14:09,293 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127982214] [2022-02-20 17:14:09,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:09,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:14:09,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:09,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:14:09,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:09,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:14:09,307 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:09,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:14:09,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:14:09,308 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:14:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:09,514 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-02-20 17:14:09,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:14:09,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:14:09,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:09,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:14:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:14:09,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:09,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 17:14:09,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:09,586 INFO L225 Difference]: With dead ends: 50 [2022-02-20 17:14:09,586 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:14:09,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-02-20 17:14:09,587 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:09,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 146 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:14:09,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:14:09,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-02-20 17:14:09,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:09,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:14:09,608 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:14:09,609 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:14:09,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:09,614 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-02-20 17:14:09,615 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2022-02-20 17:14:09,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:09,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:09,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-02-20 17:14:09,616 INFO L87 Difference]: Start difference. First operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-02-20 17:14:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:09,622 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-02-20 17:14:09,622 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2022-02-20 17:14:09,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:09,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:09,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:09,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:14:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2022-02-20 17:14:09,627 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 18 [2022-02-20 17:14:09,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:09,628 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2022-02-20 17:14:09,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:14:09,629 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-02-20 17:14:09,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 17:14:09,629 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:09,629 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:09,651 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-02-20 17:14:09,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:09,843 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:09,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:09,844 INFO L85 PathProgramCache]: Analyzing trace with hash 5607206, now seen corresponding path program 1 times [2022-02-20 17:14:09,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:09,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310696453] [2022-02-20 17:14:09,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:09,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:09,859 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:09,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [609528489] [2022-02-20 17:14:09,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:09,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:09,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:09,861 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-02-20 17:14:09,876 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-02-20 17:14:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:09,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:14:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:09,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:10,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {1052#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1052#true} is VALID [2022-02-20 17:14:10,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {1052#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := (if main_#t~nondet4#1 % 65536 % 65536 <= 32767 then main_#t~nondet4#1 % 65536 % 65536 else main_#t~nondet4#1 % 65536 % 65536 - 65536);havoc main_#t~nondet4#1;main_~n~0#1 := 0;main_~x~0#1 := 0;main_~y~0#1 := 1;main_~z~0#1 := 6; {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:10,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:10,087 INFO L290 TraceCheckUtils]: 3: Hoare triple {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} assume !!(main_#t~post5#1 < 1);havoc main_#t~post5#1; {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:10,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == 6 + 6 * main_~n~0#1 then 1 else 0)); {1052#true} is VALID [2022-02-20 17:14:10,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {1052#true} ~cond := #in~cond; {1052#true} is VALID [2022-02-20 17:14:10,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {1052#true} assume !(0 == ~cond); {1052#true} is VALID [2022-02-20 17:14:10,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-02-20 17:14:10,089 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1052#true} {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #48#return; {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:10,089 INFO L272 TraceCheckUtils]: 9: Hoare triple {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == 1 + (3 * main_~n~0#1 * main_~n~0#1 + 3 * main_~n~0#1) then 1 else 0)); {1052#true} is VALID [2022-02-20 17:14:10,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {1052#true} ~cond := #in~cond; {1052#true} is VALID [2022-02-20 17:14:10,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {1052#true} assume !(0 == ~cond); {1052#true} is VALID [2022-02-20 17:14:10,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-02-20 17:14:10,091 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1052#true} {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #50#return; {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:10,091 INFO L272 TraceCheckUtils]: 14: Hoare triple {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~n~0#1 * main_~n~0#1 * main_~n~0#1 then 1 else 0)); {1052#true} is VALID [2022-02-20 17:14:10,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {1052#true} ~cond := #in~cond; {1052#true} is VALID [2022-02-20 17:14:10,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {1052#true} assume !(0 == ~cond); {1052#true} is VALID [2022-02-20 17:14:10,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {1052#true} assume true; {1052#true} is VALID [2022-02-20 17:14:10,093 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1052#true} {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} #52#return; {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:14:10,094 INFO L272 TraceCheckUtils]: 19: Hoare triple {1060#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0) (= 6 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == main_~y~0#1 * main_~z~0#1 - 18 * main_~x~0#1 - 12 * main_~y~0#1 + 2 * main_~z~0#1 - 6 then 1 else 0)); {1115#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:10,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {1115#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1119#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:14:10,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {1119#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1053#false} is VALID [2022-02-20 17:14:10,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {1053#false} assume !false; {1053#false} is VALID [2022-02-20 17:14:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:14:10,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:14:10,096 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:14:10,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310696453] [2022-02-20 17:14:10,096 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:14:10,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609528489] [2022-02-20 17:14:10,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609528489] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:10,101 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:10,101 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:14:10,102 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652085895] [2022-02-20 17:14:10,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:10,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-02-20 17:14:10,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:10,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:14:10,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:10,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:14:10,119 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:14:10,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:14:10,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:14:10,120 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:14:10,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:10,374 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2022-02-20 17:14:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:14:10,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-02-20 17:14:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:14:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:14:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:10,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 17:14:10,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:10,451 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:14:10,452 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 17:14:10,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-02-20 17:14:10,453 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:10,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 141 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:14:10,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 17:14:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 17:14:10,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:10,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:10,463 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:10,463 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:10,465 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-02-20 17:14:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-02-20 17:14:10,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:10,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:10,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 46 states. [2022-02-20 17:14:10,467 INFO L87 Difference]: Start difference. First operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 46 states. [2022-02-20 17:14:10,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:10,469 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-02-20 17:14:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-02-20 17:14:10,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:10,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:10,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:10,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:10,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:14:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-02-20 17:14:10,472 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 23 [2022-02-20 17:14:10,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:10,472 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-02-20 17:14:10,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:14:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-02-20 17:14:10,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 17:14:10,473 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:10,474 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:10,500 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-02-20 17:14:10,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:10,692 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:10,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:10,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1172224904, now seen corresponding path program 1 times [2022-02-20 17:14:10,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:14:10,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894205663] [2022-02-20 17:14:10,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:10,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:14:10,711 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:14:10,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1090872940] [2022-02-20 17:14:10,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:10,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:10,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:10,713 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-02-20 17:14:10,746 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-02-20 17:14:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:14:10,763 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:14:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:14:10,799 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:14:10,800 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:14:10,801 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:14:10,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 17:14:11,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:14:11,018 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:11,020 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:14:11,040 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); [2022-02-20 17:14:11,046 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 17:14:11,049 INFO L158 Benchmark]: Toolchain (without parser) took 4967.72ms. Allocated memory was 102.8MB in the beginning and 138.4MB in the end (delta: 35.7MB). Free memory was 82.2MB in the beginning and 109.5MB in the end (delta: -27.4MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. [2022-02-20 17:14:11,049 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 60.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:14:11,050 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.71ms. Allocated memory is still 102.8MB. Free memory was 82.2MB in the beginning and 70.8MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:14:11,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.83ms. Allocated memory is still 102.8MB. Free memory was 70.8MB in the beginning and 69.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:14:11,050 INFO L158 Benchmark]: Boogie Preprocessor took 24.37ms. Allocated memory is still 102.8MB. Free memory was 69.0MB in the beginning and 68.0MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:14:11,051 INFO L158 Benchmark]: RCFGBuilder took 252.92ms. Allocated memory is still 102.8MB. Free memory was 68.0MB in the beginning and 57.2MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:14:11,051 INFO L158 Benchmark]: TraceAbstraction took 4403.22ms. Allocated memory was 102.8MB in the beginning and 138.4MB in the end (delta: 35.7MB). Free memory was 56.7MB in the beginning and 109.5MB in the end (delta: -52.8MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2022-02-20 17:14:11,052 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 60.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.71ms. Allocated memory is still 102.8MB. Free memory was 82.2MB in the beginning and 70.8MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.83ms. Allocated memory is still 102.8MB. Free memory was 70.8MB in the beginning and 69.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.37ms. Allocated memory is still 102.8MB. Free memory was 69.0MB in the beginning and 68.0MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 252.92ms. Allocated memory is still 102.8MB. Free memory was 68.0MB in the beginning and 57.2MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4403.22ms. Allocated memory was 102.8MB in the beginning and 138.4MB in the end (delta: 35.7MB). Free memory was 56.7MB in the beginning and 109.5MB in the end (delta: -52.8MB). Peak memory consumption was 41.7MB. 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 17:14:11,067 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/cohencu-ll_unwindbound1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b537bfce1176c41c6bc215444effcd63b1e343cf1b15ee69a282ebedb146c69 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:14:12,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:14:12,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:14:12,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:14:12,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:14:12,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:14:12,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:14:12,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:14:12,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:14:12,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:14:12,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:14:12,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:14:12,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:14:12,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:14:12,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:14:12,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:14:12,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:14:12,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:14:12,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:14:12,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:14:12,942 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:14:12,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:14:12,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:14:12,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:14:12,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:14:12,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:14:12,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:14:12,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:14:12,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:14:12,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:14:12,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:14:12,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:14:12,957 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:14:12,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:14:12,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:14:12,958 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:14:12,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:14:12,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:14:12,960 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:14:12,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:14:12,961 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:14:12,965 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 17:14:12,999 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:14:12,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:14:13,000 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:14:13,000 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:14:13,001 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:14:13,001 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:14:13,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:14:13,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:14:13,003 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:14:13,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:14:13,004 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:14:13,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:14:13,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:14:13,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:14:13,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:14:13,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:14:13,005 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:14:13,005 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:14:13,005 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:14:13,006 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:14:13,006 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:14:13,006 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:14:13,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:14:13,007 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:14:13,007 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:14:13,007 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:14:13,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:14:13,007 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:14:13,008 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:14:13,008 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:14:13,008 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:14:13,008 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:14:13,009 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:14:13,009 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:14:13,009 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:14:13,009 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:14:13,009 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b537bfce1176c41c6bc215444effcd63b1e343cf1b15ee69a282ebedb146c69 [2022-02-20 17:14:13,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:14:13,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:14:13,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:14:13,343 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:14:13,344 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:14:13,345 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound1.c [2022-02-20 17:14:13,402 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce56c2db8/627386bac2a443988fd09032a252f6d9/FLAGfde31894a [2022-02-20 17:14:13,780 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:14:13,780 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound1.c [2022-02-20 17:14:13,791 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce56c2db8/627386bac2a443988fd09032a252f6d9/FLAGfde31894a [2022-02-20 17:14:13,800 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce56c2db8/627386bac2a443988fd09032a252f6d9 [2022-02-20 17:14:13,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:14:13,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:14:13,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:14:13,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:14:13,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:14:13,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:14:13" (1/1) ... [2022-02-20 17:14:13,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55fd8512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:13, skipping insertion in model container [2022-02-20 17:14:13,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:14:13" (1/1) ... [2022-02-20 17:14:13,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:14:13,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:14:13,930 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/cohencu-ll_unwindbound1.c[588,601] [2022-02-20 17:14:13,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:14:13,970 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:14:14,007 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/cohencu-ll_unwindbound1.c[588,601] [2022-02-20 17:14:14,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:14:14,037 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:14:14,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:14 WrapperNode [2022-02-20 17:14:14,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:14:14,039 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:14:14,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:14:14,039 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:14:14,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:14" (1/1) ... [2022-02-20 17:14:14,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:14" (1/1) ... [2022-02-20 17:14:14,068 INFO L137 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2022-02-20 17:14:14,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:14:14,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:14:14,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:14:14,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:14:14,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:14" (1/1) ... [2022-02-20 17:14:14,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:14" (1/1) ... [2022-02-20 17:14:14,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:14" (1/1) ... [2022-02-20 17:14:14,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:14" (1/1) ... [2022-02-20 17:14:14,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:14" (1/1) ... [2022-02-20 17:14:14,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:14" (1/1) ... [2022-02-20 17:14:14,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:14" (1/1) ... [2022-02-20 17:14:14,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:14:14,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:14:14,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:14:14,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:14:14,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:14" (1/1) ... [2022-02-20 17:14:14,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:14:14,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:14:14,122 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-02-20 17:14:14,126 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-02-20 17:14:14,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:14:14,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:14:14,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:14:14,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:14:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:14:14,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:14:14,200 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:14:14,201 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:14:14,328 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:14:14,340 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:14:14,341 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:14:14,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:14:14 BoogieIcfgContainer [2022-02-20 17:14:14,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:14:14,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:14:14,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:14:14,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:14:14,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:14:13" (1/3) ... [2022-02-20 17:14:14,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1a3a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:14:14, skipping insertion in model container [2022-02-20 17:14:14,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:14:14" (2/3) ... [2022-02-20 17:14:14,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1a3a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:14:14, skipping insertion in model container [2022-02-20 17:14:14,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:14:14" (3/3) ... [2022-02-20 17:14:14,348 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound1.c [2022-02-20 17:14:14,352 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:14:14,353 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:14:14,390 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:14:14,395 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:14:14,396 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:14:14,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:14:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:14:14,414 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:14,414 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:14,415 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:14,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:14,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1823967074, now seen corresponding path program 1 times [2022-02-20 17:14:14,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:14:14,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471161967] [2022-02-20 17:14:14,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:14,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:14:14,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:14:14,435 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:14:14,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 17:14:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:14,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:14:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:14,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:14,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {29#true} is VALID [2022-02-20 17:14:14,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~n~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~y~0#1 := 1bv64;main_~z~0#1 := 6bv64; {29#true} is VALID [2022-02-20 17:14:14,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-02-20 17:14:14,620 INFO L272 TraceCheckUtils]: 3: Hoare triple {30#false} call __VERIFIER_assert((if main_~z~0#1 == ~bvadd64(6bv64, ~bvmul64(6bv64, main_~n~0#1)) then 1bv32 else 0bv32)); {30#false} is VALID [2022-02-20 17:14:14,620 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-02-20 17:14:14,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#false} assume 0bv32 == ~cond; {30#false} is VALID [2022-02-20 17:14:14,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 17:14:14,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:14:14,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:14:14,623 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:14:14,623 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471161967] [2022-02-20 17:14:14,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471161967] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:14,624 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:14,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:14:14,626 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974834969] [2022-02-20 17:14:14,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:14,631 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2022-02-20 17:14:14,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:14,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-20 17:14:14,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:14,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:14:14,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:14:14,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:14:14,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:14:14,686 INFO L87 Difference]: Start difference. First operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-20 17:14:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:16,435 INFO L93 Difference]: Finished difference Result 50 states and 87 transitions. [2022-02-20 17:14:16,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:14:16,435 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2022-02-20 17:14:16,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-20 17:14:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:14:16,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-20 17:14:16,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:14:16,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2022-02-20 17:14:17,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:17,841 INFO L225 Difference]: With dead ends: 50 [2022-02-20 17:14:17,841 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:14:17,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-02-20 17:14:17,846 INFO L933 BasicCegarLoop]: 37 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, 37 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-02-20 17:14:17,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:14:17,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:14:17,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 17:14:17,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:17,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:17,869 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:17,869 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:17,874 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2022-02-20 17:14:17,874 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-02-20 17:14:17,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:17,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:17,875 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 22 states. [2022-02-20 17:14:17,876 INFO L87 Difference]: Start difference. First operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 22 states. [2022-02-20 17:14:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:17,879 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2022-02-20 17:14:17,880 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-02-20 17:14:17,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:17,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:17,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:17,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:17,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2022-02-20 17:14:17,888 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 7 [2022-02-20 17:14:17,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:17,888 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2022-02-20 17:14:17,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-02-20 17:14:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-02-20 17:14:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:14:17,889 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:17,889 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:17,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:14:18,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:14:18,092 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:18,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:18,093 INFO L85 PathProgramCache]: Analyzing trace with hash 178926099, now seen corresponding path program 1 times [2022-02-20 17:14:18,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:14:18,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842126014] [2022-02-20 17:14:18,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:18,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:14:18,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:14:18,095 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:14:18,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 17:14:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:18,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:14:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:18,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:18,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {208#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {213#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:14:18,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#(= ~counter~0 (_ bv0 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~n~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~y~0#1 := 1bv64;main_~z~0#1 := 6bv64; {213#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:14:18,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#(= ~counter~0 (_ bv0 32))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {220#(= |ULTIMATE.start_main_#t~post5#1| (_ bv0 32))} is VALID [2022-02-20 17:14:18,227 INFO L290 TraceCheckUtils]: 3: Hoare triple {220#(= |ULTIMATE.start_main_#t~post5#1| (_ bv0 32))} assume !~bvslt32(main_#t~post5#1, 1bv32);havoc main_#t~post5#1; {209#false} is VALID [2022-02-20 17:14:18,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {209#false} call __VERIFIER_assert((if main_~z~0#1 == ~bvadd64(6bv64, ~bvmul64(6bv64, main_~n~0#1)) then 1bv32 else 0bv32)); {209#false} is VALID [2022-02-20 17:14:18,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {209#false} ~cond := #in~cond; {209#false} is VALID [2022-02-20 17:14:18,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {209#false} assume 0bv32 == ~cond; {209#false} is VALID [2022-02-20 17:14:18,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {209#false} assume !false; {209#false} is VALID [2022-02-20 17:14:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:14:18,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:14:18,229 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:14:18,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842126014] [2022-02-20 17:14:18,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842126014] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:18,230 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:18,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:14:18,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757054768] [2022-02-20 17:14:18,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:18,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2022-02-20 17:14:18,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:18,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-02-20 17:14:18,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:18,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:14:18,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:14:18,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:14:18,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:14:18,244 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-02-20 17:14:22,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:22,840 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-02-20 17:14:22,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:14:22,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2022-02-20 17:14:22,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-02-20 17:14:22,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-02-20 17:14:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-02-20 17:14:22,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-02-20 17:14:22,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-02-20 17:14:23,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:23,725 INFO L225 Difference]: With dead ends: 36 [2022-02-20 17:14:23,725 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:14:23,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-02-20 17:14:23,727 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 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-02-20 17:14:23,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:14:23,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:14:23,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:14:23,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:23,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:23,733 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:23,733 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:23,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:23,736 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-02-20 17:14:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-02-20 17:14:23,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:23,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:23,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 24 states. [2022-02-20 17:14:23,738 INFO L87 Difference]: Start difference. First operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 24 states. [2022-02-20 17:14:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:23,740 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-02-20 17:14:23,741 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-02-20 17:14:23,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:23,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:23,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:23,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:14:23,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2022-02-20 17:14:23,744 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 8 [2022-02-20 17:14:23,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:23,745 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2022-02-20 17:14:23,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-02-20 17:14:23,745 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-02-20 17:14:23,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:14:23,746 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:23,746 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:23,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:14:23,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:14:23,954 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:23,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:23,955 INFO L85 PathProgramCache]: Analyzing trace with hash 180475231, now seen corresponding path program 1 times [2022-02-20 17:14:23,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:14:23,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678491852] [2022-02-20 17:14:23,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:23,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:14:23,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:14:23,957 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:14:23,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 17:14:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:23,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:14:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:23,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:24,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {378#true} is VALID [2022-02-20 17:14:24,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~n~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~y~0#1 := 1bv64;main_~z~0#1 := 6bv64; {386#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:14:24,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {386#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {386#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:14:24,122 INFO L290 TraceCheckUtils]: 3: Hoare triple {386#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} assume !!~bvslt32(main_#t~post5#1, 1bv32);havoc main_#t~post5#1; {386#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:14:24,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {386#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} call __VERIFIER_assert((if main_~z~0#1 == ~bvadd64(6bv64, ~bvmul64(6bv64, main_~n~0#1)) then 1bv32 else 0bv32)); {396#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:24,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {396#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {400#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:14:24,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {400#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {379#false} is VALID [2022-02-20 17:14:24,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {379#false} assume !false; {379#false} is VALID [2022-02-20 17:14:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:14:24,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:14:24,130 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:14:24,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678491852] [2022-02-20 17:14:24,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678491852] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:24,130 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:24,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:14:24,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571019793] [2022-02-20 17:14:24,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:24,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2022-02-20 17:14:24,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:24,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 17:14:24,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:24,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:14:24,145 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:14:24,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:14:24,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:14:24,148 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 17:14:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:29,752 INFO L93 Difference]: Finished difference Result 42 states and 63 transitions. [2022-02-20 17:14:29,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:14:29,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2022-02-20 17:14:29,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:29,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 17:14:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 17:14:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:29,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 17:14:30,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:30,839 INFO L225 Difference]: With dead ends: 42 [2022-02-20 17:14:30,839 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 17:14:30,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-02-20 17:14:30,840 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:30,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 131 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 17:14:30,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 17:14:30,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-02-20 17:14:30,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:30,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 35 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:14:30,852 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 35 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:14:30,853 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 35 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:14:30,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:30,856 INFO L93 Difference]: Finished difference Result 40 states and 61 transitions. [2022-02-20 17:14:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 61 transitions. [2022-02-20 17:14:30,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:30,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:30,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 40 states. [2022-02-20 17:14:30,859 INFO L87 Difference]: Start difference. First operand has 35 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 40 states. [2022-02-20 17:14:30,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:30,862 INFO L93 Difference]: Finished difference Result 40 states and 61 transitions. [2022-02-20 17:14:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 61 transitions. [2022-02-20 17:14:30,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:30,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:30,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:30,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:14:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2022-02-20 17:14:30,871 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 8 [2022-02-20 17:14:30,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:30,871 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2022-02-20 17:14:30,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-02-20 17:14:30,871 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2022-02-20 17:14:30,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:14:30,872 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:30,872 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:30,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:14:31,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:14:31,080 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:31,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:31,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1275442234, now seen corresponding path program 1 times [2022-02-20 17:14:31,082 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:14:31,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248533346] [2022-02-20 17:14:31,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:31,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:14:31,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:14:31,083 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:14:31,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 17:14:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:31,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:14:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:31,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:31,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {612#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {612#true} is VALID [2022-02-20 17:14:31,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {612#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~n~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~y~0#1 := 1bv64;main_~z~0#1 := 6bv64; {620#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:14:31,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {620#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {620#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:14:31,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {620#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)))} assume !!~bvslt32(main_#t~post5#1, 1bv32);havoc main_#t~post5#1; {620#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:14:31,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {620#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)))} call __VERIFIER_assert((if main_~z~0#1 == ~bvadd64(6bv64, ~bvmul64(6bv64, main_~n~0#1)) then 1bv32 else 0bv32)); {612#true} is VALID [2022-02-20 17:14:31,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {612#true} ~cond := #in~cond; {612#true} is VALID [2022-02-20 17:14:31,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {612#true} assume !(0bv32 == ~cond); {612#true} is VALID [2022-02-20 17:14:31,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {612#true} assume true; {612#true} is VALID [2022-02-20 17:14:31,311 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {612#true} {620#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)))} #48#return; {620#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:14:31,312 INFO L272 TraceCheckUtils]: 9: Hoare triple {620#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)))} call __VERIFIER_assert((if main_~y~0#1 == ~bvadd64(1bv64, ~bvadd64(~bvmul64(~bvmul64(3bv64, main_~n~0#1), main_~n~0#1), ~bvmul64(3bv64, main_~n~0#1))) then 1bv32 else 0bv32)); {645#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:31,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {645#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {649#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:14:31,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {649#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {613#false} is VALID [2022-02-20 17:14:31,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {613#false} assume !false; {613#false} is VALID [2022-02-20 17:14:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:14:31,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:14:31,314 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:14:31,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248533346] [2022-02-20 17:14:31,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248533346] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:31,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:31,315 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:14:31,315 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826678772] [2022-02-20 17:14:31,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:31,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 17:14:31,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:31,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:14:31,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:31,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:14:31,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:14:31,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:14:31,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:14:31,358 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:14:37,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:37,734 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-02-20 17:14:37,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:14:37,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 17:14:37,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:14:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:14:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:37,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 17:14:38,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:38,831 INFO L225 Difference]: With dead ends: 46 [2022-02-20 17:14:38,831 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 17:14:38,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-02-20 17:14:38,832 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:38,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 140 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 17:14:38,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 17:14:38,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2022-02-20 17:14:38,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:38,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 39 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:14:38,840 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 39 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:14:38,841 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 39 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:14:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:38,844 INFO L93 Difference]: Finished difference Result 44 states and 64 transitions. [2022-02-20 17:14:38,844 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2022-02-20 17:14:38,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:38,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:38,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 44 states. [2022-02-20 17:14:38,846 INFO L87 Difference]: Start difference. First operand has 39 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 44 states. [2022-02-20 17:14:38,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:38,849 INFO L93 Difference]: Finished difference Result 44 states and 64 transitions. [2022-02-20 17:14:38,849 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2022-02-20 17:14:38,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:38,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:38,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:38,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:38,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:14:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2022-02-20 17:14:38,853 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 13 [2022-02-20 17:14:38,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:38,853 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2022-02-20 17:14:38,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:14:38,853 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2022-02-20 17:14:38,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:14:38,854 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:38,854 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:38,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:14:39,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:14:39,067 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:39,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:39,068 INFO L85 PathProgramCache]: Analyzing trace with hash 427545983, now seen corresponding path program 1 times [2022-02-20 17:14:39,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:14:39,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782844576] [2022-02-20 17:14:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:39,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:14:39,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:14:39,070 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:14:39,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 17:14:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:39,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:14:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:39,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:39,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {879#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {879#true} is VALID [2022-02-20 17:14:39,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {879#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~n~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~y~0#1 := 1bv64;main_~z~0#1 := 6bv64; {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:14:39,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:14:39,349 INFO L290 TraceCheckUtils]: 3: Hoare triple {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} assume !!~bvslt32(main_#t~post5#1, 1bv32);havoc main_#t~post5#1; {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:14:39,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == ~bvadd64(6bv64, ~bvmul64(6bv64, main_~n~0#1)) then 1bv32 else 0bv32)); {879#true} is VALID [2022-02-20 17:14:39,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {879#true} ~cond := #in~cond; {879#true} is VALID [2022-02-20 17:14:39,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {879#true} assume !(0bv32 == ~cond); {879#true} is VALID [2022-02-20 17:14:39,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {879#true} assume true; {879#true} is VALID [2022-02-20 17:14:39,351 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {879#true} {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} #48#return; {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:14:39,351 INFO L272 TraceCheckUtils]: 9: Hoare triple {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == ~bvadd64(1bv64, ~bvadd64(~bvmul64(~bvmul64(3bv64, main_~n~0#1), main_~n~0#1), ~bvmul64(3bv64, main_~n~0#1))) then 1bv32 else 0bv32)); {879#true} is VALID [2022-02-20 17:14:39,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {879#true} ~cond := #in~cond; {879#true} is VALID [2022-02-20 17:14:39,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {879#true} assume !(0bv32 == ~cond); {879#true} is VALID [2022-02-20 17:14:39,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {879#true} assume true; {879#true} is VALID [2022-02-20 17:14:39,356 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {879#true} {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} #50#return; {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:14:39,357 INFO L272 TraceCheckUtils]: 14: Hoare triple {887#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == ~bvmul64(~bvmul64(main_~n~0#1, main_~n~0#1), main_~n~0#1) then 1bv32 else 0bv32)); {927#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:39,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {927#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {931#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:14:39,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {931#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {880#false} is VALID [2022-02-20 17:14:39,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {880#false} assume !false; {880#false} is VALID [2022-02-20 17:14:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:14:39,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:14:39,360 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:14:39,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782844576] [2022-02-20 17:14:39,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782844576] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:39,360 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:39,360 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:14:39,360 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940462889] [2022-02-20 17:14:39,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:39,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:14:39,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:39,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:14:39,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:39,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:14:39,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:14:39,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:14:39,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:14:39,485 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:14:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:48,717 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-02-20 17:14:48,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:14:48,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:14:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:48,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:14:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:14:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:48,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 17:14:49,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:49,826 INFO L225 Difference]: With dead ends: 50 [2022-02-20 17:14:49,826 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:14:49,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-02-20 17:14:49,827 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:14:49,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 137 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 17:14:49,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:14:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-02-20 17:14:49,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:14:49,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:14:49,835 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:14:49,836 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:14:49,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:49,846 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-02-20 17:14:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2022-02-20 17:14:49,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:49,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:49,848 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-02-20 17:14:49,850 INFO L87 Difference]: Start difference. First operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-02-20 17:14:49,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:49,853 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2022-02-20 17:14:49,853 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2022-02-20 17:14:49,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:14:49,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:14:49,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:14:49,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:14:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:14:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2022-02-20 17:14:49,857 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 18 [2022-02-20 17:14:49,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:14:49,858 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2022-02-20 17:14:49,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:14:49,859 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-02-20 17:14:49,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 17:14:49,859 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:14:49,859 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:14:49,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:14:50,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:14:50,068 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:14:50,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:14:50,068 INFO L85 PathProgramCache]: Analyzing trace with hash 5607206, now seen corresponding path program 1 times [2022-02-20 17:14:50,069 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:14:50,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030127541] [2022-02-20 17:14:50,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:14:50,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:14:50,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:14:50,070 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:14:50,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 17:14:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:50,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 17:14:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:14:50,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:14:50,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {1181#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {1181#true} is VALID [2022-02-20 17:14:50,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {1181#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~n~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~y~0#1 := 1bv64;main_~z~0#1 := 6bv64; {1189#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:14:50,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {1189#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {1189#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:14:50,430 INFO L290 TraceCheckUtils]: 3: Hoare triple {1189#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} assume !!~bvslt32(main_#t~post5#1, 1bv32);havoc main_#t~post5#1; {1189#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:14:50,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {1189#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~z~0#1 == ~bvadd64(6bv64, ~bvmul64(6bv64, main_~n~0#1)) then 1bv32 else 0bv32)); {1181#true} is VALID [2022-02-20 17:14:50,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {1181#true} ~cond := #in~cond; {1181#true} is VALID [2022-02-20 17:14:50,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {1181#true} assume !(0bv32 == ~cond); {1181#true} is VALID [2022-02-20 17:14:50,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {1181#true} assume true; {1181#true} is VALID [2022-02-20 17:14:50,431 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1181#true} {1189#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} #48#return; {1189#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:14:50,431 INFO L272 TraceCheckUtils]: 9: Hoare triple {1189#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~y~0#1 == ~bvadd64(1bv64, ~bvadd64(~bvmul64(~bvmul64(3bv64, main_~n~0#1), main_~n~0#1), ~bvmul64(3bv64, main_~n~0#1))) then 1bv32 else 0bv32)); {1181#true} is VALID [2022-02-20 17:14:50,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {1181#true} ~cond := #in~cond; {1181#true} is VALID [2022-02-20 17:14:50,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {1181#true} assume !(0bv32 == ~cond); {1181#true} is VALID [2022-02-20 17:14:50,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {1181#true} assume true; {1181#true} is VALID [2022-02-20 17:14:50,432 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1181#true} {1189#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} #50#return; {1189#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:14:50,432 INFO L272 TraceCheckUtils]: 14: Hoare triple {1189#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == ~bvmul64(~bvmul64(main_~n~0#1, main_~n~0#1), main_~n~0#1) then 1bv32 else 0bv32)); {1181#true} is VALID [2022-02-20 17:14:50,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {1181#true} ~cond := #in~cond; {1181#true} is VALID [2022-02-20 17:14:50,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {1181#true} assume !(0bv32 == ~cond); {1181#true} is VALID [2022-02-20 17:14:50,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {1181#true} assume true; {1181#true} is VALID [2022-02-20 17:14:50,434 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1181#true} {1189#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} #52#return; {1189#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:14:50,435 INFO L272 TraceCheckUtils]: 19: Hoare triple {1189#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if 0bv64 == ~bvsub64(~bvadd64(~bvsub64(~bvsub64(~bvmul64(main_~y~0#1, main_~z~0#1), ~bvmul64(18bv64, main_~x~0#1)), ~bvmul64(12bv64, main_~y~0#1)), ~bvmul64(2bv64, main_~z~0#1)), 6bv64) then 1bv32 else 0bv32)); {1244#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:14:50,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {1244#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1248#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:14:50,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {1248#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {1182#false} is VALID [2022-02-20 17:14:50,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {1182#false} assume !false; {1182#false} is VALID [2022-02-20 17:14:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:14:50,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:14:50,436 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:14:50,436 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030127541] [2022-02-20 17:14:50,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030127541] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:14:50,436 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:14:50,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:14:50,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919096817] [2022-02-20 17:14:50,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:14:50,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-02-20 17:14:50,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:14:50,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:14:50,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:14:50,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:14:50,624 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:14:50,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:14:50,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:14:50,625 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:14:59,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:14:59,192 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2022-02-20 17:14:59,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:14:59,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-02-20 17:14:59,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:14:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:14:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:14:59,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:14:59,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 17:15:00,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:00,506 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:15:00,506 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 17:15:00,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-02-20 17:15:00,508 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:00,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 129 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-20 17:15:00,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 17:15:00,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 17:15:00,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:00,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:00,513 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:00,514 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:00,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:00,516 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-02-20 17:15:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-02-20 17:15:00,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:00,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:00,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 46 states. [2022-02-20 17:15:00,517 INFO L87 Difference]: Start difference. First operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 46 states. [2022-02-20 17:15:00,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:00,519 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-02-20 17:15:00,519 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-02-20 17:15:00,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:00,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:00,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:00,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-02-20 17:15:00,522 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 23 [2022-02-20 17:15:00,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:00,522 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-02-20 17:15:00,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:15:00,523 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-02-20 17:15:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 17:15:00,523 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:00,523 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:00,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 17:15:00,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:15:00,732 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:00,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:00,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1618699309, now seen corresponding path program 1 times [2022-02-20 17:15:00,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:15:00,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783518592] [2022-02-20 17:15:00,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:00,733 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:15:00,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:15:00,734 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:15:00,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 17:15:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:00,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:15:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:15:00,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:15:01,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {1505#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {1505#true} is VALID [2022-02-20 17:15:01,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {1505#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~n~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~y~0#1 := 1bv64;main_~z~0#1 := 6bv64; {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:15:01,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:15:01,251 INFO L290 TraceCheckUtils]: 3: Hoare triple {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} assume !!~bvslt32(main_#t~post5#1, 1bv32);havoc main_#t~post5#1; {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:15:01,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} call __VERIFIER_assert((if main_~z~0#1 == ~bvadd64(6bv64, ~bvmul64(6bv64, main_~n~0#1)) then 1bv32 else 0bv32)); {1505#true} is VALID [2022-02-20 17:15:01,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-02-20 17:15:01,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {1505#true} assume !(0bv32 == ~cond); {1505#true} is VALID [2022-02-20 17:15:01,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-02-20 17:15:01,253 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1505#true} {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} #48#return; {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:15:01,253 INFO L272 TraceCheckUtils]: 9: Hoare triple {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} call __VERIFIER_assert((if main_~y~0#1 == ~bvadd64(1bv64, ~bvadd64(~bvmul64(~bvmul64(3bv64, main_~n~0#1), main_~n~0#1), ~bvmul64(3bv64, main_~n~0#1))) then 1bv32 else 0bv32)); {1505#true} is VALID [2022-02-20 17:15:01,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-02-20 17:15:01,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {1505#true} assume !(0bv32 == ~cond); {1505#true} is VALID [2022-02-20 17:15:01,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-02-20 17:15:01,254 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1505#true} {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} #50#return; {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:15:01,254 INFO L272 TraceCheckUtils]: 14: Hoare triple {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} call __VERIFIER_assert((if main_~x~0#1 == ~bvmul64(~bvmul64(main_~n~0#1, main_~n~0#1), main_~n~0#1) then 1bv32 else 0bv32)); {1505#true} is VALID [2022-02-20 17:15:01,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-02-20 17:15:01,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {1505#true} assume !(0bv32 == ~cond); {1505#true} is VALID [2022-02-20 17:15:01,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-02-20 17:15:01,256 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1505#true} {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} #52#return; {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:15:01,256 INFO L272 TraceCheckUtils]: 19: Hoare triple {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} call __VERIFIER_assert((if 0bv64 == ~bvsub64(~bvadd64(~bvsub64(~bvsub64(~bvmul64(main_~y~0#1, main_~z~0#1), ~bvmul64(18bv64, main_~x~0#1)), ~bvmul64(12bv64, main_~y~0#1)), ~bvmul64(2bv64, main_~z~0#1)), 6bv64) then 1bv32 else 0bv32)); {1505#true} is VALID [2022-02-20 17:15:01,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-02-20 17:15:01,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {1505#true} assume !(0bv32 == ~cond); {1505#true} is VALID [2022-02-20 17:15:01,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-02-20 17:15:01,257 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1505#true} {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} #54#return; {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:15:01,258 INFO L272 TraceCheckUtils]: 24: Hoare triple {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} call __VERIFIER_assert((if 0bv64 == ~bvadd64(12bv64, ~bvsub64(~bvsub64(~bvmul64(main_~z~0#1, main_~z~0#1), ~bvmul64(12bv64, main_~y~0#1)), ~bvmul64(6bv64, main_~z~0#1))) then 1bv32 else 0bv32)); {1505#true} is VALID [2022-02-20 17:15:01,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-02-20 17:15:01,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {1505#true} assume !(0bv32 == ~cond); {1505#true} is VALID [2022-02-20 17:15:01,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-02-20 17:15:01,261 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1505#true} {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} #56#return; {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:15:01,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {1513#(and (= |ULTIMATE.start_main_~z~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv0 64)))} assume !!~bvsle64(main_~n~0#1, ~sign_extendFrom32To64(~sign_extendFrom16To32(main_~a~0#1)));main_~n~0#1 := ~bvadd64(1bv64, main_~n~0#1);main_~x~0#1 := ~bvadd64(main_~x~0#1, main_~y~0#1);main_~y~0#1 := ~bvadd64(main_~y~0#1, main_~z~0#1);main_~z~0#1 := ~bvadd64(6bv64, main_~z~0#1); {1598#(and (= (bvadd |ULTIMATE.start_main_~z~0#1| (_ bv18446744073709551610 64)) (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:15:01,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {1598#(and (= (bvadd |ULTIMATE.start_main_~z~0#1| (_ bv18446744073709551610 64)) (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv1 64)))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {1598#(and (= (bvadd |ULTIMATE.start_main_~z~0#1| (_ bv18446744073709551610 64)) (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:15:01,263 INFO L290 TraceCheckUtils]: 31: Hoare triple {1598#(and (= (bvadd |ULTIMATE.start_main_~z~0#1| (_ bv18446744073709551610 64)) (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv1 64)))} assume !~bvslt32(main_#t~post5#1, 1bv32);havoc main_#t~post5#1; {1598#(and (= (bvadd |ULTIMATE.start_main_~z~0#1| (_ bv18446744073709551610 64)) (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:15:01,264 INFO L272 TraceCheckUtils]: 32: Hoare triple {1598#(and (= (bvadd |ULTIMATE.start_main_~z~0#1| (_ bv18446744073709551610 64)) (_ bv6 64)) (= |ULTIMATE.start_main_~n~0#1| (_ bv1 64)))} call __VERIFIER_assert((if main_~z~0#1 == ~bvadd64(6bv64, ~bvmul64(6bv64, main_~n~0#1)) then 1bv32 else 0bv32)); {1608#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:15:01,264 INFO L290 TraceCheckUtils]: 33: Hoare triple {1608#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1612#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:15:01,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {1612#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {1506#false} is VALID [2022-02-20 17:15:01,266 INFO L290 TraceCheckUtils]: 35: Hoare triple {1506#false} assume !false; {1506#false} is VALID [2022-02-20 17:15:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:15:01,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:15:01,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {1506#false} assume !false; {1506#false} is VALID [2022-02-20 17:15:01,602 INFO L290 TraceCheckUtils]: 34: Hoare triple {1622#(not (= __VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == ~cond; {1506#false} is VALID [2022-02-20 17:15:01,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {1626#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1622#(not (= __VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2022-02-20 17:15:01,604 INFO L272 TraceCheckUtils]: 32: Hoare triple {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} call __VERIFIER_assert((if main_~z~0#1 == ~bvadd64(6bv64, ~bvmul64(6bv64, main_~n~0#1)) then 1bv32 else 0bv32)); {1626#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 17:15:01,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} assume !~bvslt32(main_#t~post5#1, 1bv32);havoc main_#t~post5#1; {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} is VALID [2022-02-20 17:15:01,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} is VALID [2022-02-20 17:15:02,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} assume !!~bvsle64(main_~n~0#1, ~sign_extendFrom32To64(~sign_extendFrom16To32(main_~a~0#1)));main_~n~0#1 := ~bvadd64(1bv64, main_~n~0#1);main_~x~0#1 := ~bvadd64(main_~x~0#1, main_~y~0#1);main_~y~0#1 := ~bvadd64(main_~y~0#1, main_~z~0#1);main_~z~0#1 := ~bvadd64(6bv64, main_~z~0#1); {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} is VALID [2022-02-20 17:15:02,623 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1505#true} {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} #56#return; {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} is VALID [2022-02-20 17:15:02,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-02-20 17:15:02,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {1505#true} assume !(0bv32 == ~cond); {1505#true} is VALID [2022-02-20 17:15:02,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-02-20 17:15:02,624 INFO L272 TraceCheckUtils]: 24: Hoare triple {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} call __VERIFIER_assert((if 0bv64 == ~bvadd64(12bv64, ~bvsub64(~bvsub64(~bvmul64(main_~z~0#1, main_~z~0#1), ~bvmul64(12bv64, main_~y~0#1)), ~bvmul64(6bv64, main_~z~0#1))) then 1bv32 else 0bv32)); {1505#true} is VALID [2022-02-20 17:15:02,625 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1505#true} {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} #54#return; {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} is VALID [2022-02-20 17:15:02,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-02-20 17:15:02,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {1505#true} assume !(0bv32 == ~cond); {1505#true} is VALID [2022-02-20 17:15:02,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-02-20 17:15:02,625 INFO L272 TraceCheckUtils]: 19: Hoare triple {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} call __VERIFIER_assert((if 0bv64 == ~bvsub64(~bvadd64(~bvsub64(~bvsub64(~bvmul64(main_~y~0#1, main_~z~0#1), ~bvmul64(18bv64, main_~x~0#1)), ~bvmul64(12bv64, main_~y~0#1)), ~bvmul64(2bv64, main_~z~0#1)), 6bv64) then 1bv32 else 0bv32)); {1505#true} is VALID [2022-02-20 17:15:02,626 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1505#true} {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} #52#return; {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} is VALID [2022-02-20 17:15:02,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-02-20 17:15:02,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {1505#true} assume !(0bv32 == ~cond); {1505#true} is VALID [2022-02-20 17:15:02,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-02-20 17:15:02,626 INFO L272 TraceCheckUtils]: 14: Hoare triple {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} call __VERIFIER_assert((if main_~x~0#1 == ~bvmul64(~bvmul64(main_~n~0#1, main_~n~0#1), main_~n~0#1) then 1bv32 else 0bv32)); {1505#true} is VALID [2022-02-20 17:15:02,627 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1505#true} {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} #50#return; {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} is VALID [2022-02-20 17:15:02,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-02-20 17:15:02,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {1505#true} assume !(0bv32 == ~cond); {1505#true} is VALID [2022-02-20 17:15:02,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-02-20 17:15:02,627 INFO L272 TraceCheckUtils]: 9: Hoare triple {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} call __VERIFIER_assert((if main_~y~0#1 == ~bvadd64(1bv64, ~bvadd64(~bvmul64(~bvmul64(3bv64, main_~n~0#1), main_~n~0#1), ~bvmul64(3bv64, main_~n~0#1))) then 1bv32 else 0bv32)); {1505#true} is VALID [2022-02-20 17:15:02,628 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1505#true} {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} #48#return; {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} is VALID [2022-02-20 17:15:02,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-02-20 17:15:02,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {1505#true} assume !(0bv32 == ~cond); {1505#true} is VALID [2022-02-20 17:15:02,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-02-20 17:15:02,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} call __VERIFIER_assert((if main_~z~0#1 == ~bvadd64(6bv64, ~bvmul64(6bv64, main_~n~0#1)) then 1bv32 else 0bv32)); {1505#true} is VALID [2022-02-20 17:15:02,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} assume !!~bvslt32(main_#t~post5#1, 1bv32);havoc main_#t~post5#1; {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} is VALID [2022-02-20 17:15:02,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} is VALID [2022-02-20 17:15:02,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {1505#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~n~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~n~0#1 := 0bv64;main_~x~0#1 := 0bv64;main_~y~0#1 := 1bv64;main_~z~0#1 := 6bv64; {1630#(= |ULTIMATE.start_main_~z~0#1| (bvadd (bvmul |ULTIMATE.start_main_~n~0#1| (_ bv6 64)) (_ bv6 64)))} is VALID [2022-02-20 17:15:02,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {1505#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {1505#true} is VALID [2022-02-20 17:15:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-20 17:15:02,631 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:15:02,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783518592] [2022-02-20 17:15:02,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783518592] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:15:02,632 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:15:02,632 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-02-20 17:15:02,632 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064261195] [2022-02-20 17:15:02,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:15:02,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-02-20 17:15:02,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:15:02,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:15:03,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:03,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:15:03,739 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:15:03,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:15:03,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:15:03,740 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:15:10,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:10,110 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-02-20 17:15:10,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:15:10,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-02-20 17:15:10,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:15:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:15:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 17:15:10,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:15:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 17:15:10,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-02-20 17:15:11,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:15:11,772 INFO L225 Difference]: With dead ends: 52 [2022-02-20 17:15:11,773 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 17:15:11,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:15:11,774 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 17:15:11,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 84 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 17:15:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 17:15:11,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-02-20 17:15:11,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:15:11,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:11,783 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:11,783 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:11,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:11,786 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2022-02-20 17:15:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2022-02-20 17:15:11,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:11,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:11,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 50 states. [2022-02-20 17:15:11,787 INFO L87 Difference]: Start difference. First operand has 50 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 50 states. [2022-02-20 17:15:11,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:15:11,789 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2022-02-20 17:15:11,789 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2022-02-20 17:15:11,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:15:11,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:15:11,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:15:11,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:15:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:15:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2022-02-20 17:15:11,792 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 36 [2022-02-20 17:15:11,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:15:11,793 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2022-02-20 17:15:11,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:15:11,793 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2022-02-20 17:15:11,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 17:15:11,794 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:15:11,794 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:11,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 17:15:12,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:15:12,008 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:15:12,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:15:12,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1172224904, now seen corresponding path program 1 times [2022-02-20 17:15:12,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:15:12,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836427930] [2022-02-20 17:15:12,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:15:12,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:15:12,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:15:12,010 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:15:12,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 17:15:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:15:12,200 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:15:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:15:12,458 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 17:15:12,458 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:15:12,459 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:15:12,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 17:15:12,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:15:12,663 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:15:12,665 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:15:12,681 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call __VERIFIER_assert((if ~z~0 == ~bvadd64(6bv64, ~bvmul64(6bv64, ~n~0)) then 1bv32 else 0bv32)); [2022-02-20 17:15:12,682 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 17:15:12,688 INFO L158 Benchmark]: Toolchain (without parser) took 58885.09ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 35.1MB in the beginning and 50.3MB in the end (delta: -15.1MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2022-02-20 17:15:12,688 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory is still 38.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:15:12,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.27ms. Allocated memory is still 56.6MB. Free memory was 35.0MB in the beginning and 39.1MB in the end (delta: -4.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 17:15:12,689 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.98ms. Allocated memory is still 56.6MB. Free memory was 38.9MB in the beginning and 37.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:15:12,690 INFO L158 Benchmark]: Boogie Preprocessor took 18.71ms. Allocated memory is still 56.6MB. Free memory was 37.3MB in the beginning and 35.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:15:12,690 INFO L158 Benchmark]: RCFGBuilder took 253.90ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 35.9MB in the beginning and 51.9MB in the end (delta: -15.9MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2022-02-20 17:15:12,691 INFO L158 Benchmark]: TraceAbstraction took 58340.10ms. Allocated memory is still 69.2MB. Free memory was 51.3MB in the beginning and 50.3MB in the end (delta: 1.0MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2022-02-20 17:15:12,692 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory is still 38.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.27ms. Allocated memory is still 56.6MB. Free memory was 35.0MB in the beginning and 39.1MB in the end (delta: -4.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.98ms. Allocated memory is still 56.6MB. Free memory was 38.9MB in the beginning and 37.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.71ms. Allocated memory is still 56.6MB. Free memory was 37.3MB in the beginning and 35.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 253.90ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 35.9MB in the beginning and 51.9MB in the end (delta: -15.9MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * TraceAbstraction took 58340.10ms. Allocated memory is still 69.2MB. Free memory was 51.3MB in the beginning and 50.3MB in the end (delta: 1.0MB). Peak memory consumption was 30.6MB. 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 17:15:12,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator