./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound10.i --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/divbin2_valuebound10.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5d6ad2c11d3a75b8845224ed23d407062e615cc5bd2b5ad3e6646436a3e13805 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:18:04,310 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:18:04,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:18:04,332 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:18:04,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:18:04,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:18:04,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:18:04,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:18:04,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:18:04,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:18:04,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:18:04,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:18:04,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:18:04,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:18:04,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:18:04,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:18:04,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:18:04,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:18:04,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:18:04,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:18:04,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:18:04,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:18:04,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:18:04,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:18:04,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:18:04,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:18:04,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:18:04,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:18:04,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:18:04,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:18:04,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:18:04,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:18:04,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:18:04,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:18:04,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:18:04,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:18:04,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:18:04,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:18:04,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:18:04,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:18:04,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:18:04,358 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:18:04,371 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:18:04,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:18:04,372 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:18:04,372 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:18:04,372 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:18:04,373 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:18:04,373 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:18:04,373 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:18:04,373 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:18:04,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:18:04,374 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:18:04,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:18:04,374 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:18:04,374 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:18:04,374 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:18:04,374 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:18:04,375 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:18:04,375 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:18:04,375 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:18:04,375 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:18:04,375 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:18:04,375 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:18:04,375 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:18:04,376 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:18:04,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:18:04,376 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:18:04,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:18:04,376 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:18:04,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:18:04,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:18:04,377 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:18:04,377 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:18:04,377 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:18:04,377 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 -> 5d6ad2c11d3a75b8845224ed23d407062e615cc5bd2b5ad3e6646436a3e13805 [2022-02-20 17:18:04,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:18:04,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:18:04,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:18:04,575 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:18:04,576 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:18:04,576 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound10.i [2022-02-20 17:18:04,617 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50f128c29/6f2dd8f15e394341934f0d5f36003971/FLAGb401b8ae1 [2022-02-20 17:18:04,979 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:18:04,980 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound10.i [2022-02-20 17:18:04,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50f128c29/6f2dd8f15e394341934f0d5f36003971/FLAGb401b8ae1 [2022-02-20 17:18:05,421 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50f128c29/6f2dd8f15e394341934f0d5f36003971 [2022-02-20 17:18:05,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:18:05,424 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:18:05,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:18:05,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:18:05,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:18:05,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:18:05" (1/1) ... [2022-02-20 17:18:05,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f84e00a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:05, skipping insertion in model container [2022-02-20 17:18:05,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:18:05" (1/1) ... [2022-02-20 17:18:05,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:18:05,448 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:18:05,567 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/divbin2_valuebound10.i[951,964] [2022-02-20 17:18:05,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:18:05,593 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:18:05,602 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/divbin2_valuebound10.i[951,964] [2022-02-20 17:18:05,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:18:05,627 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:18:05,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:05 WrapperNode [2022-02-20 17:18:05,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:18:05,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:18:05,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:18:05,629 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:18:05,636 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:18:05" (1/1) ... [2022-02-20 17:18:05,640 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:18:05" (1/1) ... [2022-02-20 17:18:05,656 INFO L137 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2022-02-20 17:18:05,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:18:05,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:18:05,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:18:05,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:18:05,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:05" (1/1) ... [2022-02-20 17:18:05,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:05" (1/1) ... [2022-02-20 17:18:05,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:05" (1/1) ... [2022-02-20 17:18:05,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:05" (1/1) ... [2022-02-20 17:18:05,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:05" (1/1) ... [2022-02-20 17:18:05,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:05" (1/1) ... [2022-02-20 17:18:05,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:05" (1/1) ... [2022-02-20 17:18:05,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:18:05,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:18:05,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:18:05,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:18:05,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:05" (1/1) ... [2022-02-20 17:18:05,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:18:05,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:18:05,696 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:18:05,701 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:18:05,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:18:05,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:18:05,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:18:05,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:18:05,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:18:05,720 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:18:05,755 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:18:05,756 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:18:05,846 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:18:05,852 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:18:05,852 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:18:05,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:18:05 BoogieIcfgContainer [2022-02-20 17:18:05,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:18:05,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:18:05,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:18:05,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:18:05,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:18:05" (1/3) ... [2022-02-20 17:18:05,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609386e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:18:05, skipping insertion in model container [2022-02-20 17:18:05,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:18:05" (2/3) ... [2022-02-20 17:18:05,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609386e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:18:05, skipping insertion in model container [2022-02-20 17:18:05,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:18:05" (3/3) ... [2022-02-20 17:18:05,860 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound10.i [2022-02-20 17:18:05,865 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:18:05,865 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:18:05,896 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:18:05,901 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:18:05,901 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:18:05,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:05,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:18:05,916 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:18:05,917 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:18:05,917 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:18:05,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:18:05,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1090701444, now seen corresponding path program 1 times [2022-02-20 17:18:05,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:18:05,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716091071] [2022-02-20 17:18:05,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:05,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:18:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:06,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#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(10, 2); {24#true} is VALID [2022-02-20 17:18:06,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {24#true} is VALID [2022-02-20 17:18:06,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {25#false} is VALID [2022-02-20 17:18:06,034 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#false} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {25#false} is VALID [2022-02-20 17:18:06,034 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#false} assume false; {25#false} is VALID [2022-02-20 17:18:06,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#false} assume !true; {25#false} is VALID [2022-02-20 17:18:06,035 INFO L272 TraceCheckUtils]: 6: Hoare triple {25#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {25#false} is VALID [2022-02-20 17:18:06,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-02-20 17:18:06,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-02-20 17:18:06,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-02-20 17:18:06,037 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:18:06,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:18:06,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716091071] [2022-02-20 17:18:06,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716091071] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:18:06,038 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:18:06,038 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:18:06,039 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646030785] [2022-02-20 17:18:06,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:18:06,044 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:18:06,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:18:06,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:06,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:06,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:18:06,069 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:18:06,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:18:06,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:18:06,101 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:06,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:06,166 INFO L93 Difference]: Finished difference Result 39 states and 58 transitions. [2022-02-20 17:18:06,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:18:06,166 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:18:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:18:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2022-02-20 17:18:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2022-02-20 17:18:06,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 58 transitions. [2022-02-20 17:18:06,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:06,276 INFO L225 Difference]: With dead ends: 39 [2022-02-20 17:18:06,277 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 17:18:06,279 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:18:06,282 INFO L933 BasicCegarLoop]: 24 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, 24 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:18:06,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:18:06,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 17:18:06,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 17:18:06,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:18:06,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 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:18:06,303 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 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:18:06,303 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 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:18:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:06,306 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 17:18:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 17:18:06,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:06,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:06,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-02-20 17:18:06,307 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-02-20 17:18:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:06,309 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 17:18:06,309 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 17:18:06,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:06,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:06,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:18:06,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:18:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 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:18:06,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-02-20 17:18:06,313 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2022-02-20 17:18:06,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:18:06,313 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-20 17:18:06,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:06,314 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 17:18:06,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 17:18:06,314 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:18:06,314 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:18:06,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:18:06,315 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:18:06,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:18:06,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2095969935, now seen corresponding path program 1 times [2022-02-20 17:18:06,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:18:06,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897421760] [2022-02-20 17:18:06,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:06,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:18:06,332 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:18:06,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [275741950] [2022-02-20 17:18:06,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:06,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:06,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:18:06,335 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:18:06,336 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:18:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:06,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:18:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:06,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:18:06,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {132#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(10, 2); {132#true} is VALID [2022-02-20 17:18:06,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {132#true} is VALID [2022-02-20 17:18:06,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#true} assume !(0 == assume_abort_if_not_~cond#1); {132#true} is VALID [2022-02-20 17:18:06,670 INFO L290 TraceCheckUtils]: 3: Hoare triple {132#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {146#(and (= |ULTIMATE.start_main_~b~0#1| 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:18:06,671 INFO L290 TraceCheckUtils]: 4: Hoare triple {146#(and (= |ULTIMATE.start_main_~b~0#1| 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {146#(and (= |ULTIMATE.start_main_~b~0#1| 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:18:06,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#(and (= |ULTIMATE.start_main_~b~0#1| 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {153#(and (= |ULTIMATE.start_main_~b~0#1| 1) (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:18:06,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {153#(and (= |ULTIMATE.start_main_~b~0#1| 1) (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {153#(and (= |ULTIMATE.start_main_~b~0#1| 1) (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:18:06,673 INFO L272 TraceCheckUtils]: 7: Hoare triple {153#(and (= |ULTIMATE.start_main_~b~0#1| 1) (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {160#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:18:06,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {160#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {164#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:18:06,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {164#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {133#false} is VALID [2022-02-20 17:18:06,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {133#false} assume !false; {133#false} is VALID [2022-02-20 17:18:06,674 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:18:06,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:18:06,675 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:18:06,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897421760] [2022-02-20 17:18:06,675 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:18:06,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275741950] [2022-02-20 17:18:06,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275741950] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:18:06,676 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:18:06,676 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:18:06,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87204718] [2022-02-20 17:18:06,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:18:06,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 11 [2022-02-20 17:18:06,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:18:06,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:18:06,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:06,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:18:06,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:18:06,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:18:06,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:18:06,689 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:18:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:06,808 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-02-20 17:18:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:18:06,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 11 [2022-02-20 17:18:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:18:06,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:18:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-20 17:18:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:18:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-20 17:18:06,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2022-02-20 17:18:06,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:06,858 INFO L225 Difference]: With dead ends: 29 [2022-02-20 17:18:06,858 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 17:18:06,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:18:06,859 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:18:06,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 51 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:18:06,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 17:18:06,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 17:18:06,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:18:06,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:06,867 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:06,868 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:06,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:06,870 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-02-20 17:18:06,870 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-02-20 17:18:06,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:06,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:06,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-02-20 17:18:06,872 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-02-20 17:18:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:06,875 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-02-20 17:18:06,875 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-02-20 17:18:06,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:06,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:06,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:18:06,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:18:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-02-20 17:18:06,878 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 11 [2022-02-20 17:18:06,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:18:06,878 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-02-20 17:18:06,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:18:06,879 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-02-20 17:18:06,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:18:06,879 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:18:06,879 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:18:06,897 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:18:07,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:07,096 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:18:07,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:18:07,096 INFO L85 PathProgramCache]: Analyzing trace with hash 975547596, now seen corresponding path program 1 times [2022-02-20 17:18:07,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:18:07,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248635251] [2022-02-20 17:18:07,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:07,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:18:07,111 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:18:07,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1895886569] [2022-02-20 17:18:07,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:07,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:07,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:18:07,130 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:18:07,144 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:18:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:07,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 17:18:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:07,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:18:07,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#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(10, 2); {294#true} is VALID [2022-02-20 17:18:07,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {294#true} is VALID [2022-02-20 17:18:07,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} assume !(0 == assume_abort_if_not_~cond#1); {294#true} is VALID [2022-02-20 17:18:07,518 INFO L290 TraceCheckUtils]: 3: Hoare triple {294#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {308#(and (= |ULTIMATE.start_main_~b~0#1| 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:18:07,518 INFO L290 TraceCheckUtils]: 4: Hoare triple {308#(and (= |ULTIMATE.start_main_~b~0#1| 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {308#(and (= |ULTIMATE.start_main_~b~0#1| 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:18:07,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {308#(and (= |ULTIMATE.start_main_~b~0#1| 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {315#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= 2 |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:18:07,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {315#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= 2 |ULTIMATE.start_main_~b~0#1|))} assume !false; {315#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= 2 |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:18:07,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= 2 |ULTIMATE.start_main_~b~0#1|))} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {322#(and (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= 2 |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:18:07,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {322#(and (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= 2 |ULTIMATE.start_main_~b~0#1|))} assume !false; {322#(and (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= 2 |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:18:07,521 INFO L272 TraceCheckUtils]: 9: Hoare triple {322#(and (not (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (= 2 |ULTIMATE.start_main_~b~0#1|))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {329#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:18:07,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {329#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {333#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:18:07,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {333#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {295#false} is VALID [2022-02-20 17:18:07,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-02-20 17:18:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:18:07,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:18:07,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-02-20 17:18:07,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {333#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {295#false} is VALID [2022-02-20 17:18:07,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {329#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {333#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:18:07,729 INFO L272 TraceCheckUtils]: 9: Hoare triple {349#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {329#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:18:07,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {349#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} assume !false; {349#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} is VALID [2022-02-20 17:18:07,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {356#(or (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {349#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296))} is VALID [2022-02-20 17:18:07,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {356#(or (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} assume !false; {356#(or (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is VALID [2022-02-20 17:18:09,735 WARN L290 TraceCheckUtils]: 5: Hoare triple {363#(or (<= (mod (* 2 |ULTIMATE.start_main_~b~0#1|) 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod (+ (* (* 2 |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {356#(or (<= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~q~0#1|)) 4294967296)))} is UNKNOWN [2022-02-20 17:18:09,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {363#(or (<= (mod (* 2 |ULTIMATE.start_main_~b~0#1|) 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod (+ (* (* 2 |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} assume !false; {363#(or (<= (mod (* 2 |ULTIMATE.start_main_~b~0#1|) 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod (+ (* (* 2 |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} is VALID [2022-02-20 17:18:09,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {294#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {363#(or (<= (mod (* 2 |ULTIMATE.start_main_~b~0#1|) 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (mod (+ (* (* 2 |ULTIMATE.start_main_~b~0#1|) |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))} is VALID [2022-02-20 17:18:09,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} assume !(0 == assume_abort_if_not_~cond#1); {294#true} is VALID [2022-02-20 17:18:09,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {294#true} is VALID [2022-02-20 17:18:09,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#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(10, 2); {294#true} is VALID [2022-02-20 17:18:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:18:09,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:18:09,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248635251] [2022-02-20 17:18:09,738 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:18:09,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895886569] [2022-02-20 17:18:09,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895886569] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:18:09,738 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:18:09,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-02-20 17:18:09,739 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384455393] [2022-02-20 17:18:09,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:18:09,739 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 17:18:09,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:18:09,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:11,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:11,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:18:11,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:18:11,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:18:11,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:18:11,811 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:14,531 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:18:16,539 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:18:19,758 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 17:18:22,649 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:18:24,772 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:18:27,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:27,645 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-02-20 17:18:27,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:18:27,645 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 17:18:27,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:18:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-02-20 17:18:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:27,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-02-20 17:18:27,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 61 transitions. [2022-02-20 17:18:32,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 59 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:32,053 INFO L225 Difference]: With dead ends: 51 [2022-02-20 17:18:32,053 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 17:18:32,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:18:32,054 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 12 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-02-20 17:18:32,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 109 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 114 Invalid, 5 Unknown, 0 Unchecked, 11.8s Time] [2022-02-20 17:18:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 17:18:32,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2022-02-20 17:18:32,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:18:32,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:18:32,064 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:18:32,065 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:18:32,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:32,070 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-02-20 17:18:32,070 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-02-20 17:18:32,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:32,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:32,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 46 states. [2022-02-20 17:18:32,071 INFO L87 Difference]: Start difference. First operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 46 states. [2022-02-20 17:18:32,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:32,075 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-02-20 17:18:32,075 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-02-20 17:18:32,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:32,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:32,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:18:32,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:18:32,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:18:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2022-02-20 17:18:32,080 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 13 [2022-02-20 17:18:32,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:18:32,080 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-02-20 17:18:32,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:18:32,080 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2022-02-20 17:18:32,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:18:32,081 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:18:32,081 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:18:32,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 17:18:32,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 17:18:32,288 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:18:32,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:18:32,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1791376988, now seen corresponding path program 1 times [2022-02-20 17:18:32,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:18:32,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427104752] [2022-02-20 17:18:32,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:32,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:18:32,313 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:18:32,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [165431237] [2022-02-20 17:18:32,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:32,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:32,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:18:32,315 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:18:32,316 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:18:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:32,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:18:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:32,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:18:32,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {594#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(10, 2); {594#true} is VALID [2022-02-20 17:18:32,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {594#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {594#true} is VALID [2022-02-20 17:18:32,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {594#true} assume !(0 == assume_abort_if_not_~cond#1); {594#true} is VALID [2022-02-20 17:18:32,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {594#true} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {608#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:18:32,459 INFO L290 TraceCheckUtils]: 4: Hoare triple {608#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {608#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:18:32,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {608#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {608#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:18:32,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {608#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !false; {608#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:18:32,460 INFO L272 TraceCheckUtils]: 7: Hoare triple {608#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {594#true} is VALID [2022-02-20 17:18:32,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {594#true} ~cond := #in~cond; {594#true} is VALID [2022-02-20 17:18:32,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {594#true} assume !(0 == ~cond); {594#true} is VALID [2022-02-20 17:18:32,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {594#true} assume true; {594#true} is VALID [2022-02-20 17:18:32,462 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {594#true} {608#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #67#return; {608#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:18:34,597 WARN L290 TraceCheckUtils]: 12: Hoare triple {608#(and (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~b~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(main_~b~0#1 % 4294967296 != main_~B~0#1 % 4294967296);main_~q~0#1 := 2 * main_~q~0#1;main_~b~0#1 := (if main_~b~0#1 % 4294967296 < 0 && 0 != main_~b~0#1 % 4294967296 % 2 then 1 + main_~b~0#1 % 4294967296 / 2 else main_~b~0#1 % 4294967296 / 2); {595#false} is UNKNOWN [2022-02-20 17:18:34,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {595#false} assume main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296;main_~q~0#1 := 1 + main_~q~0#1;main_~r~0#1 := main_~r~0#1 - main_~b~0#1; {595#false} is VALID [2022-02-20 17:18:34,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {595#false} assume !false; {595#false} is VALID [2022-02-20 17:18:34,598 INFO L272 TraceCheckUtils]: 15: Hoare triple {595#false} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {595#false} is VALID [2022-02-20 17:18:34,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {595#false} ~cond := #in~cond; {595#false} is VALID [2022-02-20 17:18:34,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {595#false} assume 0 == ~cond; {595#false} is VALID [2022-02-20 17:18:34,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {595#false} assume !false; {595#false} is VALID [2022-02-20 17:18:34,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:18:34,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:18:34,598 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:18:34,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427104752] [2022-02-20 17:18:34,598 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:18:34,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165431237] [2022-02-20 17:18:34,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165431237] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:18:34,599 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:18:34,599 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:18:34,599 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302295230] [2022-02-20 17:18:34,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:18:34,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 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 19 [2022-02-20 17:18:34,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:18:34,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 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:18:34,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:34,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:18:34,618 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:18:34,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:18:34,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:18:34,619 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 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:18:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:34,685 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-02-20 17:18:34,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:18:34,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 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 19 [2022-02-20 17:18:34,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:18:34,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 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:18:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-02-20 17:18:34,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 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:18:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-02-20 17:18:34,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2022-02-20 17:18:34,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:34,720 INFO L225 Difference]: With dead ends: 58 [2022-02-20 17:18:34,720 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 17:18:34,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:18:34,721 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:18:34,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:18:34,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 17:18:34,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 17:18:34,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:18:34,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:34,728 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:34,728 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:34,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:34,729 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-20 17:18:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-02-20 17:18:34,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:34,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:34,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-02-20 17:18:34,730 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-02-20 17:18:34,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:34,731 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-20 17:18:34,732 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-02-20 17:18:34,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:34,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:34,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:18:34,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:18:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-02-20 17:18:34,733 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 19 [2022-02-20 17:18:34,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:18:34,734 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-02-20 17:18:34,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 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:18:34,734 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-02-20 17:18:34,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:18:34,734 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:18:34,734 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:18:34,751 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:18:34,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:34,935 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:18:34,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:18:34,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1328621987, now seen corresponding path program 2 times [2022-02-20 17:18:34,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:18:34,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190234684] [2022-02-20 17:18:34,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:34,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:18:34,961 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:18:34,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [175621338] [2022-02-20 17:18:34,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:18:34,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:34,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:18:34,963 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:18:34,975 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:18:35,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 17:18:35,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:18:35,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:18:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:35,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:18:35,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {834#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(10, 2); {834#true} is VALID [2022-02-20 17:18:35,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {834#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~A~0#1, main_~B~0#1, main_~q~0#1, main_~r~0#1, main_~b~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~b~0#1;main_~A~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 10 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {842#(or (and (not (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10)))} is VALID [2022-02-20 17:18:35,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {842#(or (and (not (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10)))} assume !(0 == assume_abort_if_not_~cond#1); {846#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10)} is VALID [2022-02-20 17:18:35,415 INFO L290 TraceCheckUtils]: 3: Hoare triple {846#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10)} assume { :end_inline_assume_abort_if_not } true;main_~B~0#1 := 1;main_~q~0#1 := 0;main_~r~0#1 := main_~A~0#1;main_~b~0#1 := main_~B~0#1; {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} is VALID [2022-02-20 17:18:35,416 INFO L290 TraceCheckUtils]: 4: Hoare triple {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} assume !false; {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} is VALID [2022-02-20 17:18:35,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} is VALID [2022-02-20 17:18:35,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} assume !false; {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} is VALID [2022-02-20 17:18:35,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} is VALID [2022-02-20 17:18:35,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} assume !false; {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} is VALID [2022-02-20 17:18:35,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} is VALID [2022-02-20 17:18:35,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} assume !false; {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} is VALID [2022-02-20 17:18:35,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} assume !!(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296);main_~b~0#1 := 2 * main_~b~0#1; {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} is VALID [2022-02-20 17:18:35,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} assume !false; {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} is VALID [2022-02-20 17:18:35,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} assume !(main_~r~0#1 % 4294967296 >= main_~b~0#1 % 4294967296); {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} is VALID [2022-02-20 17:18:35,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} assume !false; {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} is VALID [2022-02-20 17:18:35,421 INFO L272 TraceCheckUtils]: 15: Hoare triple {850#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 10))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~b~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {887#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:18:35,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {887#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {891#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:18:35,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {891#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {835#false} is VALID [2022-02-20 17:18:35,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {835#false} assume !false; {835#false} is VALID [2022-02-20 17:18:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 17:18:35,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:18:35,422 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:18:35,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190234684] [2022-02-20 17:18:35,422 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:18:35,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175621338] [2022-02-20 17:18:35,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175621338] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:18:35,422 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:18:35,422 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 17:18:35,422 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469660686] [2022-02-20 17:18:35,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:18:35,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 19 [2022-02-20 17:18:35,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:18:35,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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:18:35,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:35,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:18:35,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:18:35,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:18:35,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:18:35,457 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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:18:35,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:35,765 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-02-20 17:18:35,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:18:35,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 19 [2022-02-20 17:18:35,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:18:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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:18:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-02-20 17:18:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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:18:35,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-02-20 17:18:35,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2022-02-20 17:18:35,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:35,940 INFO L225 Difference]: With dead ends: 43 [2022-02-20 17:18:35,940 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 17:18:35,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:18:35,942 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:18:35,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 51 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:18:35,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 17:18:35,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2022-02-20 17:18:35,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:18:35,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:35,951 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:35,951 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:35,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:35,953 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-02-20 17:18:35,953 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-02-20 17:18:35,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:35,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:35,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 40 states. [2022-02-20 17:18:35,954 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 40 states. [2022-02-20 17:18:35,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:35,955 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-02-20 17:18:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-02-20 17:18:35,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:35,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:35,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:18:35,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:18:35,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:18:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-02-20 17:18:35,956 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2022-02-20 17:18:35,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:18:35,957 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-02-20 17:18:35,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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:18:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 17:18:35,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 17:18:35,957 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:18:35,957 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:18:35,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:18:36,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:36,158 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:18:36,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:18:36,158 INFO L85 PathProgramCache]: Analyzing trace with hash -800204289, now seen corresponding path program 1 times [2022-02-20 17:18:36,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:18:36,159 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536667006] [2022-02-20 17:18:36,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:36,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:18:36,170 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:18:36,170 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2091329438] [2022-02-20 17:18:36,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:36,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:36,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:18:36,172 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:18:36,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process