./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound100.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound100.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f73abe50a425917d2dd4066f1792742190b4ae9dbdaa6d6431079d0ef1d76a5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:31:05,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:31:05,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:31:05,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:31:05,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:31:05,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:31:05,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:31:05,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:31:05,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:31:05,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:31:05,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:31:05,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:31:05,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:31:05,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:31:05,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:31:05,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:31:05,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:31:05,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:31:05,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:31:05,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:31:05,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:31:05,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:31:05,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:31:05,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:31:05,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:31:05,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:31:05,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:31:05,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:31:05,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:31:05,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:31:05,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:31:05,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:31:05,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:31:05,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:31:05,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:31:05,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:31:05,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:31:05,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:31:05,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:31:05,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:31:05,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:31:05,366 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:31:05,389 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:31:05,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:31:05,390 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:31:05,390 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:31:05,391 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:31:05,391 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:31:05,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:31:05,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:31:05,392 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:31:05,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:31:05,392 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:31:05,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:31:05,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:31:05,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:31:05,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:31:05,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:31:05,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:31:05,393 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:31:05,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:31:05,394 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:31:05,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:31:05,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:31:05,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:31:05,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:31:05,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:31:05,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:31:05,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:31:05,396 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:31:05,396 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:31:05,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:31:05,396 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:31:05,396 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:31:05,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:31:05,397 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 -> 7f73abe50a425917d2dd4066f1792742190b4ae9dbdaa6d6431079d0ef1d76a5 [2022-02-20 17:31:05,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:31:05,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:31:05,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:31:05,618 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:31:05,619 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:31:05,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound100.c [2022-02-20 17:31:05,669 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ed6b0bf/b3ada60d11a3497094baa0f38b24fbb3/FLAGdc8eb0835 [2022-02-20 17:31:06,011 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:31:06,011 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound100.c [2022-02-20 17:31:06,019 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ed6b0bf/b3ada60d11a3497094baa0f38b24fbb3/FLAGdc8eb0835 [2022-02-20 17:31:06,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ed6b0bf/b3ada60d11a3497094baa0f38b24fbb3 [2022-02-20 17:31:06,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:31:06,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:31:06,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:31:06,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:31:06,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:31:06,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba2902f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06, skipping insertion in model container [2022-02-20 17:31:06,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:31:06,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:31:06,193 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/hard-u_valuebound100.c[537,550] [2022-02-20 17:31:06,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:31:06,227 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:31:06,234 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/hard-u_valuebound100.c[537,550] [2022-02-20 17:31:06,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:31:06,248 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:31:06,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06 WrapperNode [2022-02-20 17:31:06,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:31:06,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:31:06,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:31:06,250 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:31:06,254 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:31:06" (1/1) ... [2022-02-20 17:31:06,258 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:31:06" (1/1) ... [2022-02-20 17:31:06,272 INFO L137 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2022-02-20 17:31:06,272 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:31:06,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:31:06,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:31:06,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:31:06,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:31:06,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:31:06,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:31:06,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:31:06,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:31:06,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:06,323 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:31:06,330 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:31:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:31:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:31:06,348 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:31:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:31:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:31:06,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:31:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:31:06,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:31:06,389 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:31:06,391 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:31:06,543 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:31:06,548 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:31:06,548 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:31:06,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:31:06 BoogieIcfgContainer [2022-02-20 17:31:06,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:31:06,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:31:06,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:31:06,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:31:06,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:31:06" (1/3) ... [2022-02-20 17:31:06,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3458ae11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:31:06, skipping insertion in model container [2022-02-20 17:31:06,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (2/3) ... [2022-02-20 17:31:06,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3458ae11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:31:06, skipping insertion in model container [2022-02-20 17:31:06,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:31:06" (3/3) ... [2022-02-20 17:31:06,555 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound100.c [2022-02-20 17:31:06,559 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:31:06,559 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:31:06,611 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:31:06,631 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:31:06,632 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:31:06,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:31:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 17:31:06,656 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:06,657 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:06,657 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:06,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:06,661 INFO L85 PathProgramCache]: Analyzing trace with hash -487550744, now seen corresponding path program 1 times [2022-02-20 17:31:06,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:06,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550044757] [2022-02-20 17:31:06,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:06,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:06,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:31:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:06,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-02-20 17:31:06,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-02-20 17:31:06,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-02-20 17:31:06,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #78#return; {37#false} is VALID [2022-02-20 17:31:06,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:31:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:06,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-02-20 17:31:06,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-02-20 17:31:06,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-02-20 17:31:06,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #80#return; {37#false} is VALID [2022-02-20 17:31:06,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 17:31:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:06,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-02-20 17:31:06,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-02-20 17:31:06,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-02-20 17:31:06,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #82#return; {37#false} is VALID [2022-02-20 17:31:06,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#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(9, 2);call #Ultimate.allocInit(12, 3); {36#true} is VALID [2022-02-20 17:31:06,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {36#true} is VALID [2022-02-20 17:31:06,857 INFO L272 TraceCheckUtils]: 2: Hoare triple {36#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 100 then 1 else 0)); {36#true} is VALID [2022-02-20 17:31:06,857 INFO L290 TraceCheckUtils]: 3: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-02-20 17:31:06,858 INFO L290 TraceCheckUtils]: 4: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-02-20 17:31:06,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#false} assume true; {37#false} is VALID [2022-02-20 17:31:06,858 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {37#false} {36#true} #78#return; {37#false} is VALID [2022-02-20 17:31:06,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#false} main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {37#false} is VALID [2022-02-20 17:31:06,858 INFO L272 TraceCheckUtils]: 8: Hoare triple {37#false} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 100 then 1 else 0)); {36#true} is VALID [2022-02-20 17:31:06,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-02-20 17:31:06,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-02-20 17:31:06,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#false} assume true; {37#false} is VALID [2022-02-20 17:31:06,860 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {37#false} {37#false} #80#return; {37#false} is VALID [2022-02-20 17:31:06,860 INFO L272 TraceCheckUtils]: 13: Hoare triple {37#false} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {36#true} is VALID [2022-02-20 17:31:06,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-02-20 17:31:06,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-02-20 17:31:06,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} assume true; {37#false} is VALID [2022-02-20 17:31:06,862 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {37#false} {37#false} #82#return; {37#false} is VALID [2022-02-20 17:31:06,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {37#false} is VALID [2022-02-20 17:31:06,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-02-20 17:31:06,863 INFO L272 TraceCheckUtils]: 20: Hoare triple {37#false} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {37#false} is VALID [2022-02-20 17:31:06,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-02-20 17:31:06,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-02-20 17:31:06,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-02-20 17:31:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:31:06,865 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:06,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550044757] [2022-02-20 17:31:06,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550044757] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:06,866 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:06,867 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:31:06,868 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074551433] [2022-02-20 17:31:06,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:06,873 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-02-20 17:31:06,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:06,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:31:06,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:06,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:31:06,906 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:06,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:31:06,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:31:06,927 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:31:07,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:07,013 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2022-02-20 17:31:07,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:31:07,014 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-02-20 17:31:07,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:31:07,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2022-02-20 17:31:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:31:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2022-02-20 17:31:07,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 104 transitions. [2022-02-20 17:31:07,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:07,157 INFO L225 Difference]: With dead ends: 63 [2022-02-20 17:31:07,158 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 17:31:07,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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:31:07,162 INFO L933 BasicCegarLoop]: 43 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, 43 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:31:07,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:07,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 17:31:07,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 17:31:07,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:07,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:07,186 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:07,186 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:07,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:07,190 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2022-02-20 17:31:07,190 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-02-20 17:31:07,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:07,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:07,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 29 states. [2022-02-20 17:31:07,192 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 29 states. [2022-02-20 17:31:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:07,194 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2022-02-20 17:31:07,195 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-02-20 17:31:07,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:07,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:07,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:07,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:07,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2022-02-20 17:31:07,199 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 24 [2022-02-20 17:31:07,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:07,199 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2022-02-20 17:31:07,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:31:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-02-20 17:31:07,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 17:31:07,201 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:07,201 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:07,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:31:07,201 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:07,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:07,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1636258074, now seen corresponding path program 1 times [2022-02-20 17:31:07,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:07,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140192416] [2022-02-20 17:31:07,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:07,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:07,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:31:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:07,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID [2022-02-20 17:31:07,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID [2022-02-20 17:31:07,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {242#true} assume true; {242#true} is VALID [2022-02-20 17:31:07,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {242#true} {242#true} #78#return; {242#true} is VALID [2022-02-20 17:31:07,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:31:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:07,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID [2022-02-20 17:31:07,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID [2022-02-20 17:31:07,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {242#true} assume true; {242#true} is VALID [2022-02-20 17:31:07,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {242#true} {242#true} #80#return; {242#true} is VALID [2022-02-20 17:31:07,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 17:31:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:07,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID [2022-02-20 17:31:07,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID [2022-02-20 17:31:07,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {242#true} assume true; {242#true} is VALID [2022-02-20 17:31:07,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {242#true} {242#true} #82#return; {242#true} is VALID [2022-02-20 17:31:07,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {242#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(9, 2);call #Ultimate.allocInit(12, 3); {242#true} is VALID [2022-02-20 17:31:07,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {242#true} is VALID [2022-02-20 17:31:07,280 INFO L272 TraceCheckUtils]: 2: Hoare triple {242#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 100 then 1 else 0)); {242#true} is VALID [2022-02-20 17:31:07,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID [2022-02-20 17:31:07,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID [2022-02-20 17:31:07,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {242#true} assume true; {242#true} is VALID [2022-02-20 17:31:07,281 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {242#true} {242#true} #78#return; {242#true} is VALID [2022-02-20 17:31:07,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {242#true} main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {242#true} is VALID [2022-02-20 17:31:07,281 INFO L272 TraceCheckUtils]: 8: Hoare triple {242#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 100 then 1 else 0)); {242#true} is VALID [2022-02-20 17:31:07,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID [2022-02-20 17:31:07,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID [2022-02-20 17:31:07,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {242#true} assume true; {242#true} is VALID [2022-02-20 17:31:07,282 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {242#true} {242#true} #80#return; {242#true} is VALID [2022-02-20 17:31:07,282 INFO L272 TraceCheckUtils]: 13: Hoare triple {242#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {242#true} is VALID [2022-02-20 17:31:07,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID [2022-02-20 17:31:07,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID [2022-02-20 17:31:07,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {242#true} assume true; {242#true} is VALID [2022-02-20 17:31:07,283 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {242#true} {242#true} #82#return; {242#true} is VALID [2022-02-20 17:31:07,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {242#true} main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {256#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:31:07,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {256#(= |ULTIMATE.start_main_~q~0#1| 0)} assume !false; {256#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:31:07,285 INFO L272 TraceCheckUtils]: 20: Hoare triple {256#(= |ULTIMATE.start_main_~q~0#1| 0)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {257#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:07,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {257#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {258#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:31:07,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {258#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {243#false} is VALID [2022-02-20 17:31:07,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-02-20 17:31:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:31:07,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:07,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140192416] [2022-02-20 17:31:07,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140192416] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:07,287 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:07,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:31:07,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785108843] [2022-02-20 17:31:07,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:07,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-02-20 17:31:07,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:07,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:07,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:07,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:07,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:07,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:07,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:07,305 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:07,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:07,495 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 17:31:07,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:31:07,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-02-20 17:31:07,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-20 17:31:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-20 17:31:07,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-02-20 17:31:07,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:07,550 INFO L225 Difference]: With dead ends: 42 [2022-02-20 17:31:07,551 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 17:31:07,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:31:07,552 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:07,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 134 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:07,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 17:31:07,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2022-02-20 17:31:07,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:07,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 33 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:07,557 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 33 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:07,558 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 33 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:07,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:07,560 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-02-20 17:31:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2022-02-20 17:31:07,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:07,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:07,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 40 states. [2022-02-20 17:31:07,562 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 40 states. [2022-02-20 17:31:07,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:07,564 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-02-20 17:31:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2022-02-20 17:31:07,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:07,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:07,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:07,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-02-20 17:31:07,568 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 24 [2022-02-20 17:31:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:07,568 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-02-20 17:31:07,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:07,569 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-02-20 17:31:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:31:07,569 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:07,569 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:07,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:31:07,570 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:07,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:07,570 INFO L85 PathProgramCache]: Analyzing trace with hash 906849917, now seen corresponding path program 1 times [2022-02-20 17:31:07,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:07,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102150584] [2022-02-20 17:31:07,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:07,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:07,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:31:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:07,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {450#true} ~cond := #in~cond; {450#true} is VALID [2022-02-20 17:31:07,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {450#true} assume !(0 == ~cond); {450#true} is VALID [2022-02-20 17:31:07,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2022-02-20 17:31:07,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {450#true} {450#true} #78#return; {450#true} is VALID [2022-02-20 17:31:07,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:31:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:07,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {450#true} ~cond := #in~cond; {450#true} is VALID [2022-02-20 17:31:07,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {450#true} assume !(0 == ~cond); {450#true} is VALID [2022-02-20 17:31:07,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2022-02-20 17:31:07,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {450#true} {450#true} #80#return; {450#true} is VALID [2022-02-20 17:31:07,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 17:31:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:07,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {450#true} ~cond := #in~cond; {450#true} is VALID [2022-02-20 17:31:07,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {450#true} assume !(0 == ~cond); {450#true} is VALID [2022-02-20 17:31:07,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2022-02-20 17:31:07,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {450#true} {450#true} #82#return; {450#true} is VALID [2022-02-20 17:31:07,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 17:31:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:07,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {450#true} ~cond := #in~cond; {450#true} is VALID [2022-02-20 17:31:07,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {450#true} assume !(0 == ~cond); {450#true} is VALID [2022-02-20 17:31:07,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2022-02-20 17:31:07,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {450#true} {464#(and (<= (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|)) (< (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296) 1)) (<= (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|))} #84#return; {464#(and (<= (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|)) (< (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296) 1)) (<= (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:07,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {450#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(9, 2);call #Ultimate.allocInit(12, 3); {450#true} is VALID [2022-02-20 17:31:07,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {450#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {450#true} is VALID [2022-02-20 17:31:07,734 INFO L272 TraceCheckUtils]: 2: Hoare triple {450#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 100 then 1 else 0)); {450#true} is VALID [2022-02-20 17:31:07,734 INFO L290 TraceCheckUtils]: 3: Hoare triple {450#true} ~cond := #in~cond; {450#true} is VALID [2022-02-20 17:31:07,734 INFO L290 TraceCheckUtils]: 4: Hoare triple {450#true} assume !(0 == ~cond); {450#true} is VALID [2022-02-20 17:31:07,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {450#true} assume true; {450#true} is VALID [2022-02-20 17:31:07,734 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {450#true} {450#true} #78#return; {450#true} is VALID [2022-02-20 17:31:07,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {450#true} main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {450#true} is VALID [2022-02-20 17:31:07,735 INFO L272 TraceCheckUtils]: 8: Hoare triple {450#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 100 then 1 else 0)); {450#true} is VALID [2022-02-20 17:31:07,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {450#true} ~cond := #in~cond; {450#true} is VALID [2022-02-20 17:31:07,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {450#true} assume !(0 == ~cond); {450#true} is VALID [2022-02-20 17:31:07,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {450#true} assume true; {450#true} is VALID [2022-02-20 17:31:07,735 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {450#true} {450#true} #80#return; {450#true} is VALID [2022-02-20 17:31:07,736 INFO L272 TraceCheckUtils]: 13: Hoare triple {450#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {450#true} is VALID [2022-02-20 17:31:07,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {450#true} ~cond := #in~cond; {450#true} is VALID [2022-02-20 17:31:07,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {450#true} assume !(0 == ~cond); {450#true} is VALID [2022-02-20 17:31:07,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {450#true} assume true; {450#true} is VALID [2022-02-20 17:31:07,736 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {450#true} {450#true} #82#return; {450#true} is VALID [2022-02-20 17:31:07,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {450#true} main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {464#(and (<= (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|)) (< (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296) 1)) (<= (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:07,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {464#(and (<= (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|)) (< (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296) 1)) (<= (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|))} assume !false; {464#(and (<= (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|)) (< (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296) 1)) (<= (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:07,738 INFO L272 TraceCheckUtils]: 20: Hoare triple {464#(and (<= (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|)) (< (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296) 1)) (<= (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {450#true} is VALID [2022-02-20 17:31:07,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {450#true} ~cond := #in~cond; {450#true} is VALID [2022-02-20 17:31:07,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {450#true} assume !(0 == ~cond); {450#true} is VALID [2022-02-20 17:31:07,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {450#true} assume true; {450#true} is VALID [2022-02-20 17:31:07,739 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {450#true} {464#(and (<= (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|)) (< (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296) 1)) (<= (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|))} #84#return; {464#(and (<= (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|)) (< (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296) 1)) (<= (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:07,740 INFO L272 TraceCheckUtils]: 25: Hoare triple {464#(and (<= (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|)) (< (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296) 1)) (<= (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {469#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:07,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {469#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {470#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:31:07,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {470#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {451#false} is VALID [2022-02-20 17:31:07,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {451#false} assume !false; {451#false} is VALID [2022-02-20 17:31:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:31:07,742 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:07,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102150584] [2022-02-20 17:31:07,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102150584] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:07,743 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:07,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:31:07,743 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820571861] [2022-02-20 17:31:07,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:07,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-02-20 17:31:07,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:07,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:31:07,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:07,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:07,760 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:07,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:07,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:07,761 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:31:08,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:08,005 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-02-20 17:31:08,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:31:08,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-02-20 17:31:08,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:31:08,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-20 17:31:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:31:08,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-20 17:31:08,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-02-20 17:31:08,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:08,072 INFO L225 Difference]: With dead ends: 46 [2022-02-20 17:31:08,073 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 17:31:08,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:31:08,078 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:08,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 130 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:08,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 17:31:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-02-20 17:31:08,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:08,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:08,101 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:08,103 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:08,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:08,107 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2022-02-20 17:31:08,107 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2022-02-20 17:31:08,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:08,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:08,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 44 states. [2022-02-20 17:31:08,109 INFO L87 Difference]: Start difference. First operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 44 states. [2022-02-20 17:31:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:08,111 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2022-02-20 17:31:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2022-02-20 17:31:08,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:08,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:08,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:08,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:08,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2022-02-20 17:31:08,114 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 29 [2022-02-20 17:31:08,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:08,114 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2022-02-20 17:31:08,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:31:08,114 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-02-20 17:31:08,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 17:31:08,115 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:08,115 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:08,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:31:08,116 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:08,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:08,116 INFO L85 PathProgramCache]: Analyzing trace with hash 710995206, now seen corresponding path program 1 times [2022-02-20 17:31:08,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:08,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106923910] [2022-02-20 17:31:08,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:08,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:08,129 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:08,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1274516285] [2022-02-20 17:31:08,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:08,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:08,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:08,131 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:31:08,150 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:31:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:08,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 17:31:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:08,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:08,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {680#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(9, 2);call #Ultimate.allocInit(12, 3); {680#true} is VALID [2022-02-20 17:31:08,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {680#true} is VALID [2022-02-20 17:31:08,937 INFO L272 TraceCheckUtils]: 2: Hoare triple {680#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 100 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:08,939 INFO L290 TraceCheckUtils]: 3: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-02-20 17:31:08,939 INFO L290 TraceCheckUtils]: 4: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-02-20 17:31:08,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {680#true} assume true; {680#true} is VALID [2022-02-20 17:31:08,941 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {680#true} {680#true} #78#return; {680#true} is VALID [2022-02-20 17:31:08,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {680#true} main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {680#true} is VALID [2022-02-20 17:31:08,942 INFO L272 TraceCheckUtils]: 8: Hoare triple {680#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 100 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:08,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {680#true} ~cond := #in~cond; {712#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:31:08,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {712#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {716#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:31:08,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {716#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {716#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:31:08,944 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {716#(not (= |assume_abort_if_not_#in~cond| 0))} {680#true} #80#return; {723#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100)} is VALID [2022-02-20 17:31:08,944 INFO L272 TraceCheckUtils]: 13: Hoare triple {723#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:08,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-02-20 17:31:08,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-02-20 17:31:08,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {680#true} assume true; {680#true} is VALID [2022-02-20 17:31:08,945 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {680#true} {723#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100)} #82#return; {723#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100)} is VALID [2022-02-20 17:31:08,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {723#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100)} main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {742#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100))} is VALID [2022-02-20 17:31:08,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {742#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100))} assume !false; {742#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100))} is VALID [2022-02-20 17:31:08,946 INFO L272 TraceCheckUtils]: 20: Hoare triple {742#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:08,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-02-20 17:31:08,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-02-20 17:31:08,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {680#true} assume true; {680#true} is VALID [2022-02-20 17:31:08,947 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {680#true} {742#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100))} #84#return; {742#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100))} is VALID [2022-02-20 17:31:08,948 INFO L272 TraceCheckUtils]: 25: Hoare triple {742#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:08,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-02-20 17:31:08,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-02-20 17:31:08,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {680#true} assume true; {680#true} is VALID [2022-02-20 17:31:08,949 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {680#true} {742#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100))} #86#return; {742#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100))} is VALID [2022-02-20 17:31:08,950 INFO L272 TraceCheckUtils]: 30: Hoare triple {742#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {779#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:08,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {779#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {783#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:08,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {783#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {681#false} is VALID [2022-02-20 17:31:08,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {681#false} assume !false; {681#false} is VALID [2022-02-20 17:31:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 17:31:08,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:31:09,282 INFO L290 TraceCheckUtils]: 33: Hoare triple {681#false} assume !false; {681#false} is VALID [2022-02-20 17:31:09,283 INFO L290 TraceCheckUtils]: 32: Hoare triple {783#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {681#false} is VALID [2022-02-20 17:31:09,284 INFO L290 TraceCheckUtils]: 31: Hoare triple {779#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {783#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:09,284 INFO L272 TraceCheckUtils]: 30: Hoare triple {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {779#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:09,285 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {680#true} {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} #86#return; {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:09,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {680#true} assume true; {680#true} is VALID [2022-02-20 17:31:09,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-02-20 17:31:09,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-02-20 17:31:09,285 INFO L272 TraceCheckUtils]: 25: Hoare triple {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:09,288 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {680#true} {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} #84#return; {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:09,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {680#true} assume true; {680#true} is VALID [2022-02-20 17:31:09,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-02-20 17:31:09,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-02-20 17:31:09,289 INFO L272 TraceCheckUtils]: 20: Hoare triple {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:09,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} assume !false; {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:09,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {680#true} main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:09,290 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {680#true} {680#true} #82#return; {680#true} is VALID [2022-02-20 17:31:09,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {680#true} assume true; {680#true} is VALID [2022-02-20 17:31:09,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-02-20 17:31:09,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-02-20 17:31:09,290 INFO L272 TraceCheckUtils]: 13: Hoare triple {680#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:09,290 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {680#true} {680#true} #80#return; {680#true} is VALID [2022-02-20 17:31:09,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {680#true} assume true; {680#true} is VALID [2022-02-20 17:31:09,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-02-20 17:31:09,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-02-20 17:31:09,291 INFO L272 TraceCheckUtils]: 8: Hoare triple {680#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 100 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:09,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {680#true} main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {680#true} is VALID [2022-02-20 17:31:09,291 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {680#true} {680#true} #78#return; {680#true} is VALID [2022-02-20 17:31:09,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {680#true} assume true; {680#true} is VALID [2022-02-20 17:31:09,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-02-20 17:31:09,291 INFO L290 TraceCheckUtils]: 3: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-02-20 17:31:09,291 INFO L272 TraceCheckUtils]: 2: Hoare triple {680#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 100 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:09,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {680#true} is VALID [2022-02-20 17:31:09,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {680#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(9, 2);call #Ultimate.allocInit(12, 3); {680#true} is VALID [2022-02-20 17:31:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 17:31:09,292 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:09,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106923910] [2022-02-20 17:31:09,292 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:09,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274516285] [2022-02-20 17:31:09,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274516285] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:31:09,293 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:31:09,293 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-02-20 17:31:09,293 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133280683] [2022-02-20 17:31:09,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:09,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-02-20 17:31:09,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:09,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:31:09,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:09,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:09,317 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:09,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:09,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:31:09,318 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:31:11,430 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:31:13,742 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:31:16,843 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:31:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:17,025 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-02-20 17:31:17,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:31:17,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-02-20 17:31:17,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:17,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:31:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:31:17,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:31:17,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:31:17,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 17:31:17,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:17,087 INFO L225 Difference]: With dead ends: 54 [2022-02-20 17:31:17,087 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 17:31:17,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:31:17,088 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:17,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 138 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 3 Unknown, 0 Unchecked, 6.6s Time] [2022-02-20 17:31:17,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 17:31:17,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2022-02-20 17:31:17,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:17,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:31:17,107 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:31:17,108 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:31:17,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:17,110 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-02-20 17:31:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-02-20 17:31:17,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:17,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:17,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-02-20 17:31:17,111 INFO L87 Difference]: Start difference. First operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-02-20 17:31:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:17,113 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-02-20 17:31:17,114 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-02-20 17:31:17,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:17,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:17,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:17,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:31:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2022-02-20 17:31:17,117 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 34 [2022-02-20 17:31:17,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:17,117 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2022-02-20 17:31:17,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:31:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2022-02-20 17:31:17,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 17:31:17,118 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:17,118 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:17,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:31:17,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:17,335 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:17,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:17,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1829555286, now seen corresponding path program 1 times [2022-02-20 17:31:17,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:17,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891708342] [2022-02-20 17:31:17,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:17,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:17,351 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:17,351 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1577560280] [2022-02-20 17:31:17,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:17,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:17,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:17,356 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:31:17,357 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:31:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:17,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 17:31:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:17,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:19,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {1144#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(9, 2);call #Ultimate.allocInit(12, 3); {1144#true} is VALID [2022-02-20 17:31:19,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {1144#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1144#true} is VALID [2022-02-20 17:31:19,100 INFO L272 TraceCheckUtils]: 2: Hoare triple {1144#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 100 then 1 else 0)); {1144#true} is VALID [2022-02-20 17:31:19,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {1144#true} ~cond := #in~cond; {1144#true} is VALID [2022-02-20 17:31:19,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {1144#true} assume !(0 == ~cond); {1144#true} is VALID [2022-02-20 17:31:19,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {1144#true} assume true; {1144#true} is VALID [2022-02-20 17:31:19,101 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1144#true} {1144#true} #78#return; {1144#true} is VALID [2022-02-20 17:31:19,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {1144#true} main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1144#true} is VALID [2022-02-20 17:31:19,101 INFO L272 TraceCheckUtils]: 8: Hoare triple {1144#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 100 then 1 else 0)); {1144#true} is VALID [2022-02-20 17:31:19,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {1144#true} ~cond := #in~cond; {1176#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:31:19,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {1176#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1180#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:31:19,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {1180#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1180#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:31:19,103 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1180#(not (= |assume_abort_if_not_#in~cond| 0))} {1144#true} #80#return; {1187#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100)} is VALID [2022-02-20 17:31:19,103 INFO L272 TraceCheckUtils]: 13: Hoare triple {1187#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {1144#true} is VALID [2022-02-20 17:31:19,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {1144#true} ~cond := #in~cond; {1176#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:31:19,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {1176#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1180#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:31:19,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {1180#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1180#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:31:19,111 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1180#(not (= |assume_abort_if_not_#in~cond| 0))} {1187#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100)} #82#return; {1203#(and (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100))} is VALID [2022-02-20 17:31:19,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {1203#(and (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100))} main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1207#(and (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100) (= |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:31:19,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {1207#(and (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {1207#(and (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100) (= |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:31:19,112 INFO L272 TraceCheckUtils]: 20: Hoare triple {1207#(and (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1144#true} is VALID [2022-02-20 17:31:19,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {1144#true} ~cond := #in~cond; {1144#true} is VALID [2022-02-20 17:31:19,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {1144#true} assume !(0 == ~cond); {1144#true} is VALID [2022-02-20 17:31:19,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {1144#true} assume true; {1144#true} is VALID [2022-02-20 17:31:19,113 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1144#true} {1207#(and (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #84#return; {1207#(and (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100) (= |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:31:19,113 INFO L272 TraceCheckUtils]: 25: Hoare triple {1207#(and (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1144#true} is VALID [2022-02-20 17:31:19,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {1144#true} ~cond := #in~cond; {1144#true} is VALID [2022-02-20 17:31:19,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {1144#true} assume !(0 == ~cond); {1144#true} is VALID [2022-02-20 17:31:19,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {1144#true} assume true; {1144#true} is VALID [2022-02-20 17:31:19,114 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1144#true} {1207#(and (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #86#return; {1207#(and (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100) (= |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:31:19,115 INFO L272 TraceCheckUtils]: 30: Hoare triple {1207#(and (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1144#true} is VALID [2022-02-20 17:31:19,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {1144#true} ~cond := #in~cond; {1144#true} is VALID [2022-02-20 17:31:19,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {1144#true} assume !(0 == ~cond); {1144#true} is VALID [2022-02-20 17:31:19,115 INFO L290 TraceCheckUtils]: 33: Hoare triple {1144#true} assume true; {1144#true} is VALID [2022-02-20 17:31:19,116 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1144#true} {1207#(and (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #88#return; {1207#(and (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100) (= |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:31:19,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {1207#(and (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100) (= |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_~d~0#1 % 4294967296); {1259#(and (< (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100) (= |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:31:19,117 INFO L290 TraceCheckUtils]: 36: Hoare triple {1259#(and (< (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {1259#(and (< (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100) (= |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:31:19,117 INFO L272 TraceCheckUtils]: 37: Hoare triple {1259#(and (< (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 100) (= |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)); {1266#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:19,118 INFO L290 TraceCheckUtils]: 38: Hoare triple {1266#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1270#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:19,118 INFO L290 TraceCheckUtils]: 39: Hoare triple {1270#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1145#false} is VALID [2022-02-20 17:31:19,118 INFO L290 TraceCheckUtils]: 40: Hoare triple {1145#false} assume !false; {1145#false} is VALID [2022-02-20 17:31:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-20 17:31:19,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:31:19,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:19,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891708342] [2022-02-20 17:31:19,119 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:19,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577560280] [2022-02-20 17:31:19,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577560280] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:19,119 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:19,119 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 17:31:19,119 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914344520] [2022-02-20 17:31:19,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:19,120 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-02-20 17:31:19,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:19,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 17:31:19,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:19,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:31:19,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:19,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:31:19,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:31:19,185 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 17:31:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:28,275 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2022-02-20 17:31:28,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 17:31:28,275 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-02-20 17:31:28,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:28,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 17:31:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2022-02-20 17:31:28,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 17:31:28,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2022-02-20 17:31:28,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 75 transitions. [2022-02-20 17:31:28,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:28,515 INFO L225 Difference]: With dead ends: 73 [2022-02-20 17:31:28,515 INFO L226 Difference]: Without dead ends: 69 [2022-02-20 17:31:28,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:31:28,515 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:28,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 206 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 17:31:28,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-20 17:31:28,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-02-20 17:31:28,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:28,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:31:28,553 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:31:28,553 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:31:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:28,555 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-02-20 17:31:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-02-20 17:31:28,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:28,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:28,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 69 states. [2022-02-20 17:31:28,556 INFO L87 Difference]: Start difference. First operand has 68 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 69 states. [2022-02-20 17:31:28,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:28,558 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-02-20 17:31:28,558 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-02-20 17:31:28,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:28,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:28,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:28,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:31:28,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2022-02-20 17:31:28,561 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 41 [2022-02-20 17:31:28,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:28,562 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2022-02-20 17:31:28,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 17:31:28,562 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-02-20 17:31:28,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 17:31:28,563 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:28,563 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:28,581 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:31:28,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:28,781 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:28,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:28,781 INFO L85 PathProgramCache]: Analyzing trace with hash 105343995, now seen corresponding path program 1 times [2022-02-20 17:31:28,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:28,782 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101333097] [2022-02-20 17:31:28,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:28,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:28,800 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:28,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1202546608] [2022-02-20 17:31:28,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:28,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:28,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:28,806 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:31:28,807 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:31:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:28,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 17:31:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:28,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:31,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {1620#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(9, 2);call #Ultimate.allocInit(12, 3); {1620#true} is VALID [2022-02-20 17:31:31,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {1620#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1620#true} is VALID [2022-02-20 17:31:31,334 INFO L272 TraceCheckUtils]: 2: Hoare triple {1620#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 100 then 1 else 0)); {1620#true} is VALID [2022-02-20 17:31:31,335 INFO L290 TraceCheckUtils]: 3: Hoare triple {1620#true} ~cond := #in~cond; {1634#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:31:31,336 INFO L290 TraceCheckUtils]: 4: Hoare triple {1634#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1638#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:31:31,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {1638#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1638#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:31:31,337 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1638#(not (= |assume_abort_if_not_#in~cond| 0))} {1620#true} #78#return; {1645#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} is VALID [2022-02-20 17:31:31,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {1645#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1645#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} is VALID [2022-02-20 17:31:31,337 INFO L272 TraceCheckUtils]: 8: Hoare triple {1645#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 100 then 1 else 0)); {1620#true} is VALID [2022-02-20 17:31:31,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {1620#true} ~cond := #in~cond; {1620#true} is VALID [2022-02-20 17:31:31,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {1620#true} assume !(0 == ~cond); {1620#true} is VALID [2022-02-20 17:31:31,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-02-20 17:31:31,338 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1620#true} {1645#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} #80#return; {1645#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} is VALID [2022-02-20 17:31:31,338 INFO L272 TraceCheckUtils]: 13: Hoare triple {1645#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {1620#true} is VALID [2022-02-20 17:31:31,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {1620#true} ~cond := #in~cond; {1634#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:31:31,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {1634#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1638#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:31:31,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {1638#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1638#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:31:31,339 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1638#(not (= |assume_abort_if_not_#in~cond| 0))} {1645#(<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100)} #82#return; {1679#(and (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100))} is VALID [2022-02-20 17:31:31,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {1679#(and (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 100))} main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1683#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 100))} is VALID [2022-02-20 17:31:31,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {1683#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 100))} assume !false; {1683#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 100))} is VALID [2022-02-20 17:31:31,346 INFO L272 TraceCheckUtils]: 20: Hoare triple {1683#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 100))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1620#true} is VALID [2022-02-20 17:31:31,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {1620#true} ~cond := #in~cond; {1620#true} is VALID [2022-02-20 17:31:31,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {1620#true} assume !(0 == ~cond); {1620#true} is VALID [2022-02-20 17:31:31,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-02-20 17:31:31,347 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1620#true} {1683#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 100))} #84#return; {1683#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 100))} is VALID [2022-02-20 17:31:31,347 INFO L272 TraceCheckUtils]: 25: Hoare triple {1683#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 100))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1620#true} is VALID [2022-02-20 17:31:31,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {1620#true} ~cond := #in~cond; {1620#true} is VALID [2022-02-20 17:31:31,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {1620#true} assume !(0 == ~cond); {1620#true} is VALID [2022-02-20 17:31:31,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-02-20 17:31:31,348 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1620#true} {1683#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 100))} #86#return; {1683#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 100))} is VALID [2022-02-20 17:31:31,348 INFO L272 TraceCheckUtils]: 30: Hoare triple {1683#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 100))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1620#true} is VALID [2022-02-20 17:31:31,349 INFO L290 TraceCheckUtils]: 31: Hoare triple {1620#true} ~cond := #in~cond; {1723#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:31,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {1723#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1727#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:31,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {1727#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1727#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:31,350 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1727#(not (= |__VERIFIER_assert_#in~cond| 0))} {1683#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 100))} #88#return; {1683#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 100))} is VALID [2022-02-20 17:31:31,351 INFO L290 TraceCheckUtils]: 35: Hoare triple {1683#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (<= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) 100))} assume !!(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {1737#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|) (< (div (+ (* (- 1) (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) 100) (- 4294967296)) 1))} is VALID [2022-02-20 17:31:31,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {1737#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|) (< (div (+ (* (- 1) (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) 100) (- 4294967296)) 1))} assume !false; {1737#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|) (< (div (+ (* (- 1) (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) 100) (- 4294967296)) 1))} is VALID [2022-02-20 17:31:31,352 INFO L272 TraceCheckUtils]: 37: Hoare triple {1737#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|) (< (div (+ (* (- 1) (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) 100) (- 4294967296)) 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1620#true} is VALID [2022-02-20 17:31:31,352 INFO L290 TraceCheckUtils]: 38: Hoare triple {1620#true} ~cond := #in~cond; {1620#true} is VALID [2022-02-20 17:31:31,352 INFO L290 TraceCheckUtils]: 39: Hoare triple {1620#true} assume !(0 == ~cond); {1620#true} is VALID [2022-02-20 17:31:31,352 INFO L290 TraceCheckUtils]: 40: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-02-20 17:31:31,352 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1620#true} {1737#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|) (< (div (+ (* (- 1) (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) 100) (- 4294967296)) 1))} #84#return; {1737#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|) (< (div (+ (* (- 1) (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) 100) (- 4294967296)) 1))} is VALID [2022-02-20 17:31:31,352 INFO L272 TraceCheckUtils]: 42: Hoare triple {1737#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|) (< (div (+ (* (- 1) (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) 100) (- 4294967296)) 1))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1620#true} is VALID [2022-02-20 17:31:31,353 INFO L290 TraceCheckUtils]: 43: Hoare triple {1620#true} ~cond := #in~cond; {1620#true} is VALID [2022-02-20 17:31:31,353 INFO L290 TraceCheckUtils]: 44: Hoare triple {1620#true} assume !(0 == ~cond); {1620#true} is VALID [2022-02-20 17:31:31,353 INFO L290 TraceCheckUtils]: 45: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-02-20 17:31:31,353 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1620#true} {1737#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|) (< (div (+ (* (- 1) (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) 100) (- 4294967296)) 1))} #86#return; {1737#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|) (< (div (+ (* (- 1) (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) 100) (- 4294967296)) 1))} is VALID [2022-02-20 17:31:31,355 INFO L272 TraceCheckUtils]: 47: Hoare triple {1737#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|) (< (div (+ (* (- 1) (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) 100) (- 4294967296)) 1))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1774#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:31,356 INFO L290 TraceCheckUtils]: 48: Hoare triple {1774#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1778#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:31,356 INFO L290 TraceCheckUtils]: 49: Hoare triple {1778#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1621#false} is VALID [2022-02-20 17:31:31,356 INFO L290 TraceCheckUtils]: 50: Hoare triple {1621#false} assume !false; {1621#false} is VALID [2022-02-20 17:31:31,356 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-02-20 17:31:31,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:31:34,212 INFO L290 TraceCheckUtils]: 50: Hoare triple {1621#false} assume !false; {1621#false} is VALID [2022-02-20 17:31:34,213 INFO L290 TraceCheckUtils]: 49: Hoare triple {1778#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1621#false} is VALID [2022-02-20 17:31:34,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {1774#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1778#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:34,214 INFO L272 TraceCheckUtils]: 47: Hoare triple {1794#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1774#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:34,215 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1620#true} {1794#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} #86#return; {1794#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:34,215 INFO L290 TraceCheckUtils]: 45: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-02-20 17:31:34,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {1620#true} assume !(0 == ~cond); {1620#true} is VALID [2022-02-20 17:31:34,215 INFO L290 TraceCheckUtils]: 43: Hoare triple {1620#true} ~cond := #in~cond; {1620#true} is VALID [2022-02-20 17:31:34,215 INFO L272 TraceCheckUtils]: 42: Hoare triple {1794#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1620#true} is VALID [2022-02-20 17:31:34,215 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1620#true} {1794#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} #84#return; {1794#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:34,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-02-20 17:31:34,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {1620#true} assume !(0 == ~cond); {1620#true} is VALID [2022-02-20 17:31:34,216 INFO L290 TraceCheckUtils]: 38: Hoare triple {1620#true} ~cond := #in~cond; {1620#true} is VALID [2022-02-20 17:31:34,216 INFO L272 TraceCheckUtils]: 37: Hoare triple {1794#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1620#true} is VALID [2022-02-20 17:31:34,216 INFO L290 TraceCheckUtils]: 36: Hoare triple {1794#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} assume !false; {1794#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:36,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {1831#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))))} assume !!(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {1794#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:36,274 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1727#(not (= |__VERIFIER_assert_#in~cond| 0))} {1620#true} #88#return; {1831#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))))} is VALID [2022-02-20 17:31:36,275 INFO L290 TraceCheckUtils]: 33: Hoare triple {1727#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1727#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:36,275 INFO L290 TraceCheckUtils]: 32: Hoare triple {1844#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1727#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:36,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {1620#true} ~cond := #in~cond; {1844#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:31:36,275 INFO L272 TraceCheckUtils]: 30: Hoare triple {1620#true} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1620#true} is VALID [2022-02-20 17:31:36,276 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1620#true} {1620#true} #86#return; {1620#true} is VALID [2022-02-20 17:31:36,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-02-20 17:31:36,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {1620#true} assume !(0 == ~cond); {1620#true} is VALID [2022-02-20 17:31:36,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {1620#true} ~cond := #in~cond; {1620#true} is VALID [2022-02-20 17:31:36,276 INFO L272 TraceCheckUtils]: 25: Hoare triple {1620#true} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1620#true} is VALID [2022-02-20 17:31:36,276 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1620#true} {1620#true} #84#return; {1620#true} is VALID [2022-02-20 17:31:36,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-02-20 17:31:36,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {1620#true} assume !(0 == ~cond); {1620#true} is VALID [2022-02-20 17:31:36,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {1620#true} ~cond := #in~cond; {1620#true} is VALID [2022-02-20 17:31:36,277 INFO L272 TraceCheckUtils]: 20: Hoare triple {1620#true} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1620#true} is VALID [2022-02-20 17:31:36,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {1620#true} assume !false; {1620#true} is VALID [2022-02-20 17:31:36,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {1620#true} main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1620#true} is VALID [2022-02-20 17:31:36,277 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1620#true} {1620#true} #82#return; {1620#true} is VALID [2022-02-20 17:31:36,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-02-20 17:31:36,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {1620#true} assume !(0 == ~cond); {1620#true} is VALID [2022-02-20 17:31:36,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {1620#true} ~cond := #in~cond; {1620#true} is VALID [2022-02-20 17:31:36,278 INFO L272 TraceCheckUtils]: 13: Hoare triple {1620#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {1620#true} is VALID [2022-02-20 17:31:36,278 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1620#true} {1620#true} #80#return; {1620#true} is VALID [2022-02-20 17:31:36,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-02-20 17:31:36,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {1620#true} assume !(0 == ~cond); {1620#true} is VALID [2022-02-20 17:31:36,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {1620#true} ~cond := #in~cond; {1620#true} is VALID [2022-02-20 17:31:36,278 INFO L272 TraceCheckUtils]: 8: Hoare triple {1620#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 100 then 1 else 0)); {1620#true} is VALID [2022-02-20 17:31:36,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {1620#true} main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1620#true} is VALID [2022-02-20 17:31:36,279 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1620#true} {1620#true} #78#return; {1620#true} is VALID [2022-02-20 17:31:36,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-02-20 17:31:36,279 INFO L290 TraceCheckUtils]: 4: Hoare triple {1620#true} assume !(0 == ~cond); {1620#true} is VALID [2022-02-20 17:31:36,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {1620#true} ~cond := #in~cond; {1620#true} is VALID [2022-02-20 17:31:36,279 INFO L272 TraceCheckUtils]: 2: Hoare triple {1620#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 100 then 1 else 0)); {1620#true} is VALID [2022-02-20 17:31:36,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {1620#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1620#true} is VALID [2022-02-20 17:31:36,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {1620#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(9, 2);call #Ultimate.allocInit(12, 3); {1620#true} is VALID [2022-02-20 17:31:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:31:36,280 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:36,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101333097] [2022-02-20 17:31:36,280 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:36,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202546608] [2022-02-20 17:31:36,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202546608] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:31:36,280 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:31:36,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-02-20 17:31:36,281 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756735027] [2022-02-20 17:31:36,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:31:36,281 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) Word has length 51 [2022-02-20 17:31:36,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:36,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-02-20 17:31:38,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:38,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 17:31:38,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:38,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 17:31:38,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:31:38,473 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-02-20 17:31:42,234 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:47,254 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:31:51,797 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:31:54,882 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:31:59,775 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:32:01,782 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:32:06,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:06,005 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2022-02-20 17:32:06,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 17:32:06,005 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) Word has length 51 [2022-02-20 17:32:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:32:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-02-20 17:32:06,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 97 transitions. [2022-02-20 17:32:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-02-20 17:32:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 97 transitions. [2022-02-20 17:32:06,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 97 transitions. [2022-02-20 17:32:10,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 96 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:32:10,129 INFO L225 Difference]: With dead ends: 98 [2022-02-20 17:32:10,129 INFO L226 Difference]: Without dead ends: 90 [2022-02-20 17:32:10,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-02-20 17:32:10,130 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 37 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 58 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:32:10,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 258 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 329 Invalid, 5 Unknown, 0 Unchecked, 17.3s Time] [2022-02-20 17:32:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-02-20 17:32:10,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2022-02-20 17:32:10,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:32:10,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 84 states, 49 states have (on average 1.163265306122449) internal successors, (57), 52 states have internal predecessors, (57), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:32:10,209 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 84 states, 49 states have (on average 1.163265306122449) internal successors, (57), 52 states have internal predecessors, (57), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:32:10,209 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 84 states, 49 states have (on average 1.163265306122449) internal successors, (57), 52 states have internal predecessors, (57), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:32:10,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:10,212 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2022-02-20 17:32:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 116 transitions. [2022-02-20 17:32:10,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:10,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:10,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 49 states have (on average 1.163265306122449) internal successors, (57), 52 states have internal predecessors, (57), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 90 states. [2022-02-20 17:32:10,213 INFO L87 Difference]: Start difference. First operand has 84 states, 49 states have (on average 1.163265306122449) internal successors, (57), 52 states have internal predecessors, (57), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 90 states. [2022-02-20 17:32:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:32:10,216 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2022-02-20 17:32:10,216 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 116 transitions. [2022-02-20 17:32:10,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:32:10,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:32:10,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:32:10,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:32:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.163265306122449) internal successors, (57), 52 states have internal predecessors, (57), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-02-20 17:32:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2022-02-20 17:32:10,219 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 51 [2022-02-20 17:32:10,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:32:10,220 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2022-02-20 17:32:10,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2022-02-20 17:32:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2022-02-20 17:32:10,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 17:32:10,221 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:32:10,221 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:32:10,229 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:32:10,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:10,425 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:32:10,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:32:10,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1397226472, now seen corresponding path program 1 times [2022-02-20 17:32:10,426 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:32:10,426 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081808991] [2022-02-20 17:32:10,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:10,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:32:10,437 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:32:10,438 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [544314195] [2022-02-20 17:32:10,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:32:10,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:32:10,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:32:10,439 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:32:10,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process