./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound50.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/dijkstra-u_valuebound50.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 7ab48dd793c80bfdca8b2cb012b1dd7cd8eda625223788e3f60486b3a2e166d4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:16:46,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:16:46,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:16:46,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:16:46,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:16:46,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:16:46,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:16:46,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:16:46,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:16:46,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:16:46,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:16:46,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:16:46,970 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:16:46,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:16:46,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:16:46,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:16:46,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:16:46,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:16:46,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:16:46,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:16:46,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:16:46,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:16:46,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:16:46,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:16:46,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:16:46,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:16:46,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:16:46,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:16:46,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:16:46,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:16:46,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:16:46,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:16:46,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:16:46,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:16:46,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:16:47,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:16:47,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:16:47,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:16:47,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:16:47,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:16:47,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:16:47,002 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:16:47,031 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:16:47,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:16:47,032 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:16:47,032 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:16:47,033 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:16:47,033 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:16:47,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:16:47,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:16:47,034 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:16:47,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:16:47,035 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:16:47,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:16:47,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:16:47,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:16:47,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:16:47,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:16:47,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:16:47,036 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:16:47,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:16:47,037 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:16:47,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:16:47,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:16:47,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:16:47,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:16:47,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:16:47,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:16:47,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:16:47,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:16:47,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:16:47,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:16:47,039 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:16:47,040 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:16:47,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:16:47,040 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 -> 7ab48dd793c80bfdca8b2cb012b1dd7cd8eda625223788e3f60486b3a2e166d4 [2022-02-20 17:16:47,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:16:47,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:16:47,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:16:47,287 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:16:47,287 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:16:47,288 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound50.c [2022-02-20 17:16:47,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/258900788/5e3f274ee55345e8b9f8de7f660e7d7b/FLAG9ed8464e2 [2022-02-20 17:16:47,745 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:16:47,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound50.c [2022-02-20 17:16:47,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/258900788/5e3f274ee55345e8b9f8de7f660e7d7b/FLAG9ed8464e2 [2022-02-20 17:16:47,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/258900788/5e3f274ee55345e8b9f8de7f660e7d7b [2022-02-20 17:16:47,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:16:47,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:16:47,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:16:47,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:16:47,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:16:47,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:16:47" (1/1) ... [2022-02-20 17:16:47,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c143d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:47, skipping insertion in model container [2022-02-20 17:16:47,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:16:47" (1/1) ... [2022-02-20 17:16:47,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:16:47,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:16:47,977 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/dijkstra-u_valuebound50.c[525,538] [2022-02-20 17:16:48,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:16:48,031 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:16:48,044 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/dijkstra-u_valuebound50.c[525,538] [2022-02-20 17:16:48,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:16:48,093 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:16:48,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:48 WrapperNode [2022-02-20 17:16:48,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:16:48,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:16:48,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:16:48,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:16:48,100 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:16:48" (1/1) ... [2022-02-20 17:16:48,115 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:16:48" (1/1) ... [2022-02-20 17:16:48,148 INFO L137 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2022-02-20 17:16:48,151 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:16:48,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:16:48,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:16:48,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:16:48,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:48" (1/1) ... [2022-02-20 17:16:48,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:48" (1/1) ... [2022-02-20 17:16:48,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:48" (1/1) ... [2022-02-20 17:16:48,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:48" (1/1) ... [2022-02-20 17:16:48,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:48" (1/1) ... [2022-02-20 17:16:48,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:48" (1/1) ... [2022-02-20 17:16:48,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:48" (1/1) ... [2022-02-20 17:16:48,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:16:48,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:16:48,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:16:48,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:16:48,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:48" (1/1) ... [2022-02-20 17:16:48,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:16:48,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:48,208 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:16:48,228 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:16:48,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:16:48,252 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:16:48,252 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:16:48,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:16:48,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:16:48,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:16:48,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:16:48,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:16:48,300 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:16:48,301 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:16:48,548 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:16:48,553 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:16:48,553 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:16:48,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:16:48 BoogieIcfgContainer [2022-02-20 17:16:48,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:16:48,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:16:48,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:16:48,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:16:48,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:16:47" (1/3) ... [2022-02-20 17:16:48,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1074290c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:16:48, skipping insertion in model container [2022-02-20 17:16:48,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:48" (2/3) ... [2022-02-20 17:16:48,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1074290c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:16:48, skipping insertion in model container [2022-02-20 17:16:48,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:16:48" (3/3) ... [2022-02-20 17:16:48,575 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound50.c [2022-02-20 17:16:48,579 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:16:48,579 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:16:48,619 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:16:48,624 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:16:48,624 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:16:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:16:48,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:16:48,655 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:48,656 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:48,656 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:48,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:48,665 INFO L85 PathProgramCache]: Analyzing trace with hash -645822239, now seen corresponding path program 1 times [2022-02-20 17:16:48,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:48,674 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400414715] [2022-02-20 17:16:48,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:48,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:48,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:16:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:48,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-02-20 17:16:48,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-02-20 17:16:48,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-02-20 17:16:48,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #78#return; {37#false} is VALID [2022-02-20 17:16:48,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 17:16:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:48,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-02-20 17:16:48,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-02-20 17:16:48,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-02-20 17:16:48,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #80#return; {37#false} is VALID [2022-02-20 17:16:48,869 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(13, 2);call #Ultimate.allocInit(12, 3); {36#true} is VALID [2022-02-20 17:16:48,870 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_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {36#true} is VALID [2022-02-20 17:16:48,870 INFO L272 TraceCheckUtils]: 2: Hoare triple {36#true} call assume_abort_if_not((if main_~n~0#1 % 4294967296 >= 0 && main_~n~0#1 % 4294967296 <= 50 then 1 else 0)); {36#true} is VALID [2022-02-20 17:16:48,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-02-20 17:16:48,871 INFO L290 TraceCheckUtils]: 4: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-02-20 17:16:48,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#false} assume true; {37#false} is VALID [2022-02-20 17:16:48,872 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {37#false} {36#true} #78#return; {37#false} is VALID [2022-02-20 17:16:48,872 INFO L272 TraceCheckUtils]: 7: Hoare triple {37#false} call assume_abort_if_not((if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0)); {36#true} is VALID [2022-02-20 17:16:48,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-02-20 17:16:48,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-02-20 17:16:48,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#false} assume true; {37#false} is VALID [2022-02-20 17:16:48,873 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {37#false} {37#false} #80#return; {37#false} is VALID [2022-02-20 17:16:48,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#false} main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {37#false} is VALID [2022-02-20 17:16:48,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-02-20 17:16:48,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-02-20 17:16:48,874 INFO L272 TraceCheckUtils]: 15: Hoare triple {37#false} call __VERIFIER_assert((if 0 == (main_~h~0#1 * main_~h~0#1 * main_~h~0#1 - 12 * main_~h~0#1 * main_~n~0#1 + 16 * main_~n~0#1 * main_~p~0#1 + 12 * main_~h~0#1 * main_~r~0#1 - 16 * main_~p~0#1 * main_~r~0#1 - main_~h~0#1 - 4 * main_~p~0#1) % 4294967296 then 1 else 0)); {37#false} is VALID [2022-02-20 17:16:48,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-02-20 17:16:48,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-02-20 17:16:48,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-02-20 17:16:48,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:16:48,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:48,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400414715] [2022-02-20 17:16:48,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400414715] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:48,882 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:48,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:16:48,884 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856287801] [2022-02-20 17:16:48,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:48,889 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-02-20 17:16:48,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:48,894 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:16:48,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:48,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:16:48,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:48,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:16:48,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:16:48,940 INFO L87 Difference]: Start difference. First operand has 33 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:16:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:53,282 INFO L93 Difference]: Finished difference Result 63 states and 107 transitions. [2022-02-20 17:16:53,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:16:53,283 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-02-20 17:16:53,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:53,284 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:16:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 107 transitions. [2022-02-20 17:16:53,293 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:16:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 107 transitions. [2022-02-20 17:16:53,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 107 transitions. [2022-02-20 17:16:53,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:53,447 INFO L225 Difference]: With dead ends: 63 [2022-02-20 17:16:53,448 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 17:16:53,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:16:53,453 INFO L933 BasicCegarLoop]: 44 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, 44 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:16:53,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:16:53,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 17:16:53,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 17:16:53,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:53,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:16:53,481 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:16:53,481 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:16:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:53,486 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2022-02-20 17:16:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2022-02-20 17:16:53,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:53,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:53,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 29 states. [2022-02-20 17:16:53,494 INFO L87 Difference]: Start difference. First operand has 29 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 29 states. [2022-02-20 17:16:53,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:53,502 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2022-02-20 17:16:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2022-02-20 17:16:53,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:53,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:53,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:53,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:53,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:16:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2022-02-20 17:16:53,514 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 19 [2022-02-20 17:16:53,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:53,514 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2022-02-20 17:16:53,515 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:16:53,515 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2022-02-20 17:16:53,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:16:53,516 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:53,517 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:53,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:16:53,518 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:53,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:53,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1757085840, now seen corresponding path program 1 times [2022-02-20 17:16:53,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:53,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156897464] [2022-02-20 17:16:53,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:53,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:53,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:16:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:53,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#true} ~cond := #in~cond; {241#true} is VALID [2022-02-20 17:16:53,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#true} assume !(0 == ~cond); {241#true} is VALID [2022-02-20 17:16:53,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#true} assume true; {241#true} is VALID [2022-02-20 17:16:53,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {241#true} {241#true} #78#return; {241#true} is VALID [2022-02-20 17:16:53,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 17:16:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:53,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#true} ~cond := #in~cond; {241#true} is VALID [2022-02-20 17:16:53,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#true} assume !(0 == ~cond); {241#true} is VALID [2022-02-20 17:16:53,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#true} assume true; {241#true} is VALID [2022-02-20 17:16:53,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {241#true} {241#true} #80#return; {241#true} is VALID [2022-02-20 17:16:53,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {241#true} is VALID [2022-02-20 17:16:53,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {241#true} is VALID [2022-02-20 17:16:53,824 INFO L272 TraceCheckUtils]: 2: Hoare triple {241#true} call assume_abort_if_not((if main_~n~0#1 % 4294967296 >= 0 && main_~n~0#1 % 4294967296 <= 50 then 1 else 0)); {241#true} is VALID [2022-02-20 17:16:53,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {241#true} ~cond := #in~cond; {241#true} is VALID [2022-02-20 17:16:53,825 INFO L290 TraceCheckUtils]: 4: Hoare triple {241#true} assume !(0 == ~cond); {241#true} is VALID [2022-02-20 17:16:53,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {241#true} assume true; {241#true} is VALID [2022-02-20 17:16:53,826 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {241#true} {241#true} #78#return; {241#true} is VALID [2022-02-20 17:16:53,826 INFO L272 TraceCheckUtils]: 7: Hoare triple {241#true} call assume_abort_if_not((if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0)); {241#true} is VALID [2022-02-20 17:16:53,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {241#true} ~cond := #in~cond; {241#true} is VALID [2022-02-20 17:16:53,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {241#true} assume !(0 == ~cond); {241#true} is VALID [2022-02-20 17:16:53,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {241#true} assume true; {241#true} is VALID [2022-02-20 17:16:53,827 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {241#true} {241#true} #80#return; {241#true} is VALID [2022-02-20 17:16:53,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {241#true} main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {251#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:16:53,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {251#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} assume !false; {251#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:16:53,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {251#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (div |ULTIMATE.start_main_~r~0#1| 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {252#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 1))} is VALID [2022-02-20 17:16:53,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {252#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 1))} assume !false; {252#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 1))} is VALID [2022-02-20 17:16:53,833 INFO L272 TraceCheckUtils]: 16: Hoare triple {252#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= (+ (* (div |ULTIMATE.start_main_~q~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 < (2 * main_~p~0#1 + main_~q~0#1) % 4294967296 then 1 else 0)); {253#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:16:53,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {253#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {254#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:16:53,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {254#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {242#false} is VALID [2022-02-20 17:16:53,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {242#false} assume !false; {242#false} is VALID [2022-02-20 17:16:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:16:53,835 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:53,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156897464] [2022-02-20 17:16:53,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156897464] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:53,835 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:53,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:16:53,836 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493657871] [2022-02-20 17:16:53,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:53,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-02-20 17:16:53,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:53,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:16:53,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:53,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:16:53,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:53,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:16:53,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:16:53,857 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:17:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:09,432 INFO L93 Difference]: Finished difference Result 64 states and 94 transitions. [2022-02-20 17:17:09,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:17:09,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-02-20 17:17:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:17:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:17:09,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-02-20 17:17:09,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:17:09,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-02-20 17:17:09,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 94 transitions. [2022-02-20 17:17:09,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:09,568 INFO L225 Difference]: With dead ends: 64 [2022-02-20 17:17:09,569 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 17:17:09,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:17:09,570 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 10 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 17:17:09,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 191 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 17:17:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 17:17:09,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2022-02-20 17:17:09,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:17:09,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 43 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:17:09,596 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 43 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:17:09,596 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 43 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:17:09,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:09,600 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2022-02-20 17:17:09,601 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2022-02-20 17:17:09,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:09,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:09,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 46 states. [2022-02-20 17:17:09,603 INFO L87 Difference]: Start difference. First operand has 43 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 46 states. [2022-02-20 17:17:09,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:09,606 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2022-02-20 17:17:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2022-02-20 17:17:09,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:09,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:09,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:17:09,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:17:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:17:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2022-02-20 17:17:09,612 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 20 [2022-02-20 17:17:09,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:17:09,612 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2022-02-20 17:17:09,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:17:09,612 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2022-02-20 17:17:09,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 17:17:09,613 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:17:09,613 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:17:09,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:17:09,614 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:17:09,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:17:09,614 INFO L85 PathProgramCache]: Analyzing trace with hash -332038773, now seen corresponding path program 1 times [2022-02-20 17:17:09,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:17:09,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563929320] [2022-02-20 17:17:09,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:09,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:17:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:09,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:17:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:09,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-02-20 17:17:09,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-02-20 17:17:09,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 17:17:09,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} #78#return; {517#true} is VALID [2022-02-20 17:17:09,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 17:17:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:09,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-02-20 17:17:09,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-02-20 17:17:09,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 17:17:09,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} #80#return; {517#true} is VALID [2022-02-20 17:17:09,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {517#true} is VALID [2022-02-20 17:17:09,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {517#true} is VALID [2022-02-20 17:17:09,822 INFO L272 TraceCheckUtils]: 2: Hoare triple {517#true} call assume_abort_if_not((if main_~n~0#1 % 4294967296 >= 0 && main_~n~0#1 % 4294967296 <= 50 then 1 else 0)); {517#true} is VALID [2022-02-20 17:17:09,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-02-20 17:17:09,822 INFO L290 TraceCheckUtils]: 4: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-02-20 17:17:09,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 17:17:09,823 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {517#true} {517#true} #78#return; {517#true} is VALID [2022-02-20 17:17:09,823 INFO L272 TraceCheckUtils]: 7: Hoare triple {517#true} call assume_abort_if_not((if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0)); {517#true} is VALID [2022-02-20 17:17:09,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-02-20 17:17:09,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-02-20 17:17:09,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 17:17:09,824 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {517#true} {517#true} #80#return; {517#true} is VALID [2022-02-20 17:17:09,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {517#true} main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {527#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:17:09,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {527#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} assume !false; {527#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:17:09,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {527#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (* (div |ULTIMATE.start_main_~n~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} assume !!(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296);main_~q~0#1 := 4 * main_~q~0#1; {528#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (+ (div |ULTIMATE.start_main_~q~0#1| 4294967296) (div |ULTIMATE.start_main_~r~0#1| 4294967296))))} is VALID [2022-02-20 17:17:09,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {528#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (+ (div |ULTIMATE.start_main_~q~0#1| 4294967296) (div |ULTIMATE.start_main_~r~0#1| 4294967296))))} assume !false; {528#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (+ (div |ULTIMATE.start_main_~q~0#1| 4294967296) (div |ULTIMATE.start_main_~r~0#1| 4294967296))))} is VALID [2022-02-20 17:17:09,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {528#(and (= |ULTIMATE.start_main_~p~0#1| 0) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= (+ (div |ULTIMATE.start_main_~n~0#1| 4294967296) (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)) (+ (div |ULTIMATE.start_main_~q~0#1| 4294967296) (div |ULTIMATE.start_main_~r~0#1| 4294967296))))} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {529#(and (<= (+ |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= |ULTIMATE.start_main_~p~0#1| 0))} is VALID [2022-02-20 17:17:09,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {529#(and (<= (+ |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= |ULTIMATE.start_main_~p~0#1| 0))} assume !false; {529#(and (<= (+ |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= |ULTIMATE.start_main_~p~0#1| 0))} is VALID [2022-02-20 17:17:09,830 INFO L272 TraceCheckUtils]: 18: Hoare triple {529#(and (<= (+ |ULTIMATE.start_main_~r~0#1| (* (div (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296) 1) (+ |ULTIMATE.start_main_~q~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296))) (= |ULTIMATE.start_main_~p~0#1| 0))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 < (2 * main_~p~0#1 + main_~q~0#1) % 4294967296 then 1 else 0)); {530#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:17:09,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {530#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {531#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:17:09,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {531#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {518#false} is VALID [2022-02-20 17:17:09,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {518#false} assume !false; {518#false} is VALID [2022-02-20 17:17:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:17:09,832 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:17:09,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563929320] [2022-02-20 17:17:09,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563929320] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:17:09,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174131212] [2022-02-20 17:17:09,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:09,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:17:09,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:17:09,835 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:17:09,848 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:17:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:09,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:17:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:09,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:17:10,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {517#true} is VALID [2022-02-20 17:17:10,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {517#true} is VALID [2022-02-20 17:17:10,223 INFO L272 TraceCheckUtils]: 2: Hoare triple {517#true} call assume_abort_if_not((if main_~n~0#1 % 4294967296 >= 0 && main_~n~0#1 % 4294967296 <= 50 then 1 else 0)); {517#true} is VALID [2022-02-20 17:17:10,223 INFO L290 TraceCheckUtils]: 3: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-02-20 17:17:10,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-02-20 17:17:10,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 17:17:10,224 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {517#true} {517#true} #78#return; {517#true} is VALID [2022-02-20 17:17:10,224 INFO L272 TraceCheckUtils]: 7: Hoare triple {517#true} call assume_abort_if_not((if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0)); {517#true} is VALID [2022-02-20 17:17:10,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-02-20 17:17:10,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-02-20 17:17:10,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 17:17:10,225 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {517#true} {517#true} #80#return; {517#true} is VALID [2022-02-20 17:17:10,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {517#true} main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {571#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:10,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {571#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {571#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:10,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {571#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296);main_~q~0#1 := 4 * main_~q~0#1; {578#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 4) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:10,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {578#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 4) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {578#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 4) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:10,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {578#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 4) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {585#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 4) (not (<= (mod |ULTIMATE.start_main_~q~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))))} is VALID [2022-02-20 17:17:10,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {585#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 4) (not (<= (mod |ULTIMATE.start_main_~q~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))))} assume !false; {585#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 4) (not (<= (mod |ULTIMATE.start_main_~q~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))))} is VALID [2022-02-20 17:17:10,231 INFO L272 TraceCheckUtils]: 18: Hoare triple {585#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 4) (not (<= (mod |ULTIMATE.start_main_~q~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 < (2 * main_~p~0#1 + main_~q~0#1) % 4294967296 then 1 else 0)); {592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:17:10,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:17:10,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {518#false} is VALID [2022-02-20 17:17:10,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {518#false} assume !false; {518#false} is VALID [2022-02-20 17:17:10,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:17:10,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:17:10,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {518#false} assume !false; {518#false} is VALID [2022-02-20 17:17:10,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {518#false} is VALID [2022-02-20 17:17:10,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:17:10,485 INFO L272 TraceCheckUtils]: 18: Hoare triple {612#(< (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 < (2 * main_~p~0#1 + main_~q~0#1) % 4294967296 then 1 else 0)); {592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:17:10,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {612#(< (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))} assume !false; {612#(< (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))} is VALID [2022-02-20 17:17:10,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {619#(or (<= (mod |ULTIMATE.start_main_~q~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296)) (< (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)))} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {612#(< (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296))} is VALID [2022-02-20 17:17:10,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {619#(or (<= (mod |ULTIMATE.start_main_~q~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296)) (< (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)))} assume !false; {619#(or (<= (mod |ULTIMATE.start_main_~q~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296)) (< (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)))} is VALID [2022-02-20 17:17:10,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {626#(or (< (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod (+ (* 2 |ULTIMATE.start_main_~p~0#1|) (* |ULTIMATE.start_main_~q~0#1| 4)) 4294967296)) (<= (mod (* |ULTIMATE.start_main_~q~0#1| 4) 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296)))} assume !!(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296);main_~q~0#1 := 4 * main_~q~0#1; {619#(or (<= (mod |ULTIMATE.start_main_~q~0#1| 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296)) (< (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod (+ |ULTIMATE.start_main_~q~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296)))} is VALID [2022-02-20 17:17:10,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {626#(or (< (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod (+ (* 2 |ULTIMATE.start_main_~p~0#1|) (* |ULTIMATE.start_main_~q~0#1| 4)) 4294967296)) (<= (mod (* |ULTIMATE.start_main_~q~0#1| 4) 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296)))} assume !false; {626#(or (< (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod (+ (* 2 |ULTIMATE.start_main_~p~0#1|) (* |ULTIMATE.start_main_~q~0#1| 4)) 4294967296)) (<= (mod (* |ULTIMATE.start_main_~q~0#1| 4) 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296)))} is VALID [2022-02-20 17:17:10,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {517#true} main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {626#(or (< (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod (+ (* 2 |ULTIMATE.start_main_~p~0#1|) (* |ULTIMATE.start_main_~q~0#1| 4)) 4294967296)) (<= (mod (* |ULTIMATE.start_main_~q~0#1| 4) 4294967296) (mod |ULTIMATE.start_main_~n~0#1| 4294967296)))} is VALID [2022-02-20 17:17:10,498 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {517#true} {517#true} #80#return; {517#true} is VALID [2022-02-20 17:17:10,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 17:17:10,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-02-20 17:17:10,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-02-20 17:17:10,498 INFO L272 TraceCheckUtils]: 7: Hoare triple {517#true} call assume_abort_if_not((if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0)); {517#true} is VALID [2022-02-20 17:17:10,499 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {517#true} {517#true} #78#return; {517#true} is VALID [2022-02-20 17:17:10,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 17:17:10,499 INFO L290 TraceCheckUtils]: 4: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-02-20 17:17:10,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-02-20 17:17:10,499 INFO L272 TraceCheckUtils]: 2: Hoare triple {517#true} call assume_abort_if_not((if main_~n~0#1 % 4294967296 >= 0 && main_~n~0#1 % 4294967296 <= 50 then 1 else 0)); {517#true} is VALID [2022-02-20 17:17:10,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {517#true} is VALID [2022-02-20 17:17:10,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {517#true} is VALID [2022-02-20 17:17:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:17:10,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174131212] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:17:10,500 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:17:10,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-02-20 17:17:10,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899228385] [2022-02-20 17:17:10,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:17:10,501 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 17:17:10,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:17:10,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:17:10,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:10,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 17:17:10,584 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:17:10,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 17:17:10,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:17:10,584 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:17:35,743 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:17:38,590 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:17:53,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:53,365 INFO L93 Difference]: Finished difference Result 80 states and 117 transitions. [2022-02-20 17:17:53,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 17:17:53,365 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 17:17:53,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:17:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:17:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2022-02-20 17:17:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:17:53,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2022-02-20 17:17:53,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 114 transitions. [2022-02-20 17:17:53,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:53,802 INFO L225 Difference]: With dead ends: 80 [2022-02-20 17:17:53,802 INFO L226 Difference]: Without dead ends: 69 [2022-02-20 17:17:53,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-02-20 17:17:53,804 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 34 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 97 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:17:53,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 330 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 198 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2022-02-20 17:17:53,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-20 17:17:53,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2022-02-20 17:17:53,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:17:53,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 60 states, 30 states have (on average 1.2) internal successors, (36), 33 states have internal predecessors, (36), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-02-20 17:17:53,849 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 60 states, 30 states have (on average 1.2) internal successors, (36), 33 states have internal predecessors, (36), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-02-20 17:17:53,851 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 60 states, 30 states have (on average 1.2) internal successors, (36), 33 states have internal predecessors, (36), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-02-20 17:17:53,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:53,860 INFO L93 Difference]: Finished difference Result 69 states and 101 transitions. [2022-02-20 17:17:53,860 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 101 transitions. [2022-02-20 17:17:53,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:53,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:53,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 30 states have (on average 1.2) internal successors, (36), 33 states have internal predecessors, (36), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 69 states. [2022-02-20 17:17:53,863 INFO L87 Difference]: Start difference. First operand has 60 states, 30 states have (on average 1.2) internal successors, (36), 33 states have internal predecessors, (36), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 69 states. [2022-02-20 17:17:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:53,867 INFO L93 Difference]: Finished difference Result 69 states and 101 transitions. [2022-02-20 17:17:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 101 transitions. [2022-02-20 17:17:53,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:53,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:53,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:17:53,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:17:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 30 states have (on average 1.2) internal successors, (36), 33 states have internal predecessors, (36), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-02-20 17:17:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 84 transitions. [2022-02-20 17:17:53,873 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 84 transitions. Word has length 22 [2022-02-20 17:17:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:17:53,873 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 84 transitions. [2022-02-20 17:17:53,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:17:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2022-02-20 17:17:53,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 17:17:53,874 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:17:53,874 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:17:53,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:17:54,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:17:54,092 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:17:54,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:17:54,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1041809680, now seen corresponding path program 1 times [2022-02-20 17:17:54,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:17:54,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422186970] [2022-02-20 17:17:54,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:54,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:17:54,105 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:17:54,105 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1086740269] [2022-02-20 17:17:54,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:54,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:17:54,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:17:54,106 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:17:54,127 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:17:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:54,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:17:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:54,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:17:54,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {1032#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1032#true} is VALID [2022-02-20 17:17:54,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {1032#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1032#true} is VALID [2022-02-20 17:17:54,327 INFO L272 TraceCheckUtils]: 2: Hoare triple {1032#true} call assume_abort_if_not((if main_~n~0#1 % 4294967296 >= 0 && main_~n~0#1 % 4294967296 <= 50 then 1 else 0)); {1032#true} is VALID [2022-02-20 17:17:54,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {1032#true} ~cond := #in~cond; {1032#true} is VALID [2022-02-20 17:17:54,327 INFO L290 TraceCheckUtils]: 4: Hoare triple {1032#true} assume !(0 == ~cond); {1032#true} is VALID [2022-02-20 17:17:54,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {1032#true} assume true; {1032#true} is VALID [2022-02-20 17:17:54,328 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1032#true} {1032#true} #78#return; {1032#true} is VALID [2022-02-20 17:17:54,328 INFO L272 TraceCheckUtils]: 7: Hoare triple {1032#true} call assume_abort_if_not((if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0)); {1032#true} is VALID [2022-02-20 17:17:54,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {1032#true} ~cond := #in~cond; {1032#true} is VALID [2022-02-20 17:17:54,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {1032#true} assume !(0 == ~cond); {1032#true} is VALID [2022-02-20 17:17:54,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {1032#true} assume true; {1032#true} is VALID [2022-02-20 17:17:54,328 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1032#true} {1032#true} #80#return; {1032#true} is VALID [2022-02-20 17:17:54,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {1032#true} main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {1073#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1))} is VALID [2022-02-20 17:17:54,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {1073#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1))} assume !false; {1073#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1))} is VALID [2022-02-20 17:17:54,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {1073#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1))} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {1073#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1))} is VALID [2022-02-20 17:17:54,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {1073#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1))} assume !false; {1073#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1))} is VALID [2022-02-20 17:17:54,331 INFO L272 TraceCheckUtils]: 16: Hoare triple {1073#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 < (2 * main_~p~0#1 + main_~q~0#1) % 4294967296 then 1 else 0)); {1032#true} is VALID [2022-02-20 17:17:54,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {1032#true} ~cond := #in~cond; {1032#true} is VALID [2022-02-20 17:17:54,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {1032#true} assume !(0 == ~cond); {1032#true} is VALID [2022-02-20 17:17:54,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {1032#true} assume true; {1032#true} is VALID [2022-02-20 17:17:54,332 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1032#true} {1073#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1))} #82#return; {1073#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1))} is VALID [2022-02-20 17:17:54,332 INFO L272 TraceCheckUtils]: 21: Hoare triple {1073#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1))} call __VERIFIER_assert((if (main_~p~0#1 * main_~p~0#1 + main_~r~0#1 * main_~q~0#1) % 4294967296 == main_~n~0#1 * main_~q~0#1 % 4294967296 then 1 else 0)); {1032#true} is VALID [2022-02-20 17:17:54,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {1032#true} ~cond := #in~cond; {1032#true} is VALID [2022-02-20 17:17:54,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {1032#true} assume !(0 == ~cond); {1032#true} is VALID [2022-02-20 17:17:54,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {1032#true} assume true; {1032#true} is VALID [2022-02-20 17:17:54,333 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1032#true} {1073#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1))} #84#return; {1073#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1))} is VALID [2022-02-20 17:17:54,333 INFO L272 TraceCheckUtils]: 26: Hoare triple {1073#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1))} call __VERIFIER_assert((if 0 == (main_~h~0#1 * main_~h~0#1 * main_~h~0#1 - 12 * main_~h~0#1 * main_~n~0#1 * main_~q~0#1 + 16 * main_~n~0#1 * main_~p~0#1 * main_~q~0#1 - main_~h~0#1 * main_~q~0#1 * main_~q~0#1 - 4 * main_~p~0#1 * main_~q~0#1 * main_~q~0#1 + 12 * main_~h~0#1 * main_~q~0#1 * main_~r~0#1 - 16 * main_~p~0#1 * main_~q~0#1 * main_~r~0#1) % 4294967296 then 1 else 0)); {1116#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:17:54,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {1116#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1120#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:17:54,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {1120#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1033#false} is VALID [2022-02-20 17:17:54,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {1033#false} assume !false; {1033#false} is VALID [2022-02-20 17:17:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 17:17:54,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:17:54,335 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:17:54,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422186970] [2022-02-20 17:17:54,335 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:17:54,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086740269] [2022-02-20 17:17:54,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086740269] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:17:54,335 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:17:54,335 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:17:54,336 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414451451] [2022-02-20 17:17:54,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:17:54,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 30 [2022-02-20 17:17:54,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:17:54,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:17:54,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:54,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:17:54,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:17:54,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:17:54,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:17:54,364 INFO L87 Difference]: Start difference. First operand 60 states and 84 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:17:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:57,448 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2022-02-20 17:17:57,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:17:57,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 30 [2022-02-20 17:17:57,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:17:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:17:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:17:57,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:17:57,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:17:57,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 17:17:57,521 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:17:57,525 INFO L225 Difference]: With dead ends: 70 [2022-02-20 17:17:57,525 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 17:17:57,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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:17:57,533 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 17:17:57,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 17:17:57,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 17:17:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-02-20 17:17:57,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:17:57,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:17:57,550 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:17:57,550 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:17:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:57,553 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2022-02-20 17:17:57,553 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2022-02-20 17:17:57,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:57,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:57,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 47 states. [2022-02-20 17:17:57,554 INFO L87 Difference]: Start difference. First operand has 47 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 47 states. [2022-02-20 17:17:57,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:57,556 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2022-02-20 17:17:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2022-02-20 17:17:57,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:57,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:57,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:17:57,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:17:57,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:17:57,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2022-02-20 17:17:57,560 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 30 [2022-02-20 17:17:57,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:17:57,560 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2022-02-20 17:17:57,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:17:57,561 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2022-02-20 17:17:57,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:17:57,561 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:17:57,561 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:17:57,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:17:57,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 17:17:57,768 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:17:57,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:17:57,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1015454531, now seen corresponding path program 1 times [2022-02-20 17:17:57,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:17:57,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88485187] [2022-02-20 17:17:57,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:57,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:17:57,784 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:17:57,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1494172735] [2022-02-20 17:17:57,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:57,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:17:57,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:17:57,789 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:17:57,795 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:17:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:57,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:17:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:57,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:17:57,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {1397#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1397#true} is VALID [2022-02-20 17:17:57,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {1397#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1397#true} is VALID [2022-02-20 17:17:57,997 INFO L272 TraceCheckUtils]: 2: Hoare triple {1397#true} call assume_abort_if_not((if main_~n~0#1 % 4294967296 >= 0 && main_~n~0#1 % 4294967296 <= 50 then 1 else 0)); {1397#true} is VALID [2022-02-20 17:17:57,998 INFO L290 TraceCheckUtils]: 3: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-02-20 17:17:57,998 INFO L290 TraceCheckUtils]: 4: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-02-20 17:17:57,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-02-20 17:17:57,998 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1397#true} {1397#true} #78#return; {1397#true} is VALID [2022-02-20 17:17:57,998 INFO L272 TraceCheckUtils]: 7: Hoare triple {1397#true} call assume_abort_if_not((if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0)); {1397#true} is VALID [2022-02-20 17:17:57,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-02-20 17:17:57,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-02-20 17:17:57,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-02-20 17:17:57,998 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1397#true} {1397#true} #80#return; {1397#true} is VALID [2022-02-20 17:17:57,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {1397#true} main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {1438#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:57,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {1438#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {1438#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:58,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {1438#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296);main_~q~0#1 := 4 * main_~q~0#1; {1438#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:58,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {1438#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {1438#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:58,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {1438#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296);main_~q~0#1 := 4 * main_~q~0#1; {1438#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:58,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {1438#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {1438#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:58,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {1438#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {1438#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:58,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {1438#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {1438#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:58,002 INFO L272 TraceCheckUtils]: 20: Hoare triple {1438#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 < (2 * main_~p~0#1 + main_~q~0#1) % 4294967296 then 1 else 0)); {1397#true} is VALID [2022-02-20 17:17:58,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-02-20 17:17:58,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-02-20 17:17:58,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-02-20 17:17:58,003 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1397#true} {1438#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} #82#return; {1438#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:17:58,006 INFO L272 TraceCheckUtils]: 25: Hoare triple {1438#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if (main_~p~0#1 * main_~p~0#1 + main_~r~0#1 * main_~q~0#1) % 4294967296 == main_~n~0#1 * main_~q~0#1 % 4294967296 then 1 else 0)); {1478#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:17:58,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {1478#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1482#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:17:58,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {1482#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1398#false} is VALID [2022-02-20 17:17:58,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {1398#false} assume !false; {1398#false} is VALID [2022-02-20 17:17:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 17:17:58,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:17:58,008 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:17:58,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88485187] [2022-02-20 17:17:58,008 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:17:58,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494172735] [2022-02-20 17:17:58,009 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494172735] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:17:58,009 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:17:58,009 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:17:58,009 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077589075] [2022-02-20 17:17:58,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:17:58,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-02-20 17:17:58,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:17:58,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:17:58,165 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:17:58,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:17:58,166 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:17:58,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:17:58,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:17:58,166 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:18:00,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:00,517 INFO L93 Difference]: Finished difference Result 69 states and 95 transitions. [2022-02-20 17:18:00,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:18:00,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-02-20 17:18:00,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:18:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:18:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-02-20 17:18:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:18:00,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-02-20 17:18:00,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-02-20 17:18:00,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:18:00,685 INFO L225 Difference]: With dead ends: 69 [2022-02-20 17:18:00,685 INFO L226 Difference]: Without dead ends: 65 [2022-02-20 17:18:00,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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:18:00,686 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 17:18:00,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 135 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 17:18:00,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-20 17:18:00,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-02-20 17:18:00,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:18:00,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 25 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-02-20 17:18:00,714 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 25 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-02-20 17:18:00,715 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 25 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-02-20 17:18:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:00,720 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2022-02-20 17:18:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2022-02-20 17:18:00,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:00,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:00,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 25 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states. [2022-02-20 17:18:00,722 INFO L87 Difference]: Start difference. First operand has 65 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 25 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 65 states. [2022-02-20 17:18:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:18:00,725 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2022-02-20 17:18:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2022-02-20 17:18:00,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:18:00,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:18:00,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:18:00,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:18:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 25 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-02-20 17:18:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2022-02-20 17:18:00,729 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 29 [2022-02-20 17:18:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:18:00,729 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2022-02-20 17:18:00,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:18:00,730 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2022-02-20 17:18:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 17:18:00,730 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:18:00,730 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:18:00,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:18:00,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:00,941 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:18:00,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:18:00,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1797429611, now seen corresponding path program 1 times [2022-02-20 17:18:00,941 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:18:00,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34138191] [2022-02-20 17:18:00,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:00,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:18:00,967 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:18:00,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101175668] [2022-02-20 17:18:00,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:18:00,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:18:00,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:18:00,971 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:18:00,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:18:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:01,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:18:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:18:01,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:18:01,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {1822#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1822#true} is VALID [2022-02-20 17:18:01,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {1822#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~n~0#1, main_~p~0#1, main_~q~0#1, main_~r~0#1, main_~h~0#1;havoc main_~n~0#1;havoc main_~p~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~h~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1822#true} is VALID [2022-02-20 17:18:01,164 INFO L272 TraceCheckUtils]: 2: Hoare triple {1822#true} call assume_abort_if_not((if main_~n~0#1 % 4294967296 >= 0 && main_~n~0#1 % 4294967296 <= 50 then 1 else 0)); {1822#true} is VALID [2022-02-20 17:18:01,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {1822#true} ~cond := #in~cond; {1822#true} is VALID [2022-02-20 17:18:01,164 INFO L290 TraceCheckUtils]: 4: Hoare triple {1822#true} assume !(0 == ~cond); {1822#true} is VALID [2022-02-20 17:18:01,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-02-20 17:18:01,164 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1822#true} {1822#true} #78#return; {1822#true} is VALID [2022-02-20 17:18:01,164 INFO L272 TraceCheckUtils]: 7: Hoare triple {1822#true} call assume_abort_if_not((if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0)); {1822#true} is VALID [2022-02-20 17:18:01,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {1822#true} ~cond := #in~cond; {1822#true} is VALID [2022-02-20 17:18:01,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {1822#true} assume !(0 == ~cond); {1822#true} is VALID [2022-02-20 17:18:01,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-02-20 17:18:01,165 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1822#true} {1822#true} #80#return; {1822#true} is VALID [2022-02-20 17:18:01,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {1822#true} main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {1863#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:18:01,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {1863#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} assume !false; {1863#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:18:01,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {1863#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} assume !!(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296);main_~q~0#1 := 4 * main_~q~0#1; {1863#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:18:01,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {1863#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} assume !false; {1863#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:18:01,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {1863#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {1863#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:18:01,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {1863#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} assume !false; {1863#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:18:01,168 INFO L272 TraceCheckUtils]: 18: Hoare triple {1863#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 < (2 * main_~p~0#1 + main_~q~0#1) % 4294967296 then 1 else 0)); {1822#true} is VALID [2022-02-20 17:18:01,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {1822#true} ~cond := #in~cond; {1822#true} is VALID [2022-02-20 17:18:01,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {1822#true} assume !(0 == ~cond); {1822#true} is VALID [2022-02-20 17:18:01,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-02-20 17:18:01,170 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1822#true} {1863#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} #82#return; {1863#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:18:01,170 INFO L272 TraceCheckUtils]: 23: Hoare triple {1863#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} call __VERIFIER_assert((if (main_~p~0#1 * main_~p~0#1 + main_~r~0#1 * main_~q~0#1) % 4294967296 == main_~n~0#1 * main_~q~0#1 % 4294967296 then 1 else 0)); {1822#true} is VALID [2022-02-20 17:18:01,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {1822#true} ~cond := #in~cond; {1822#true} is VALID [2022-02-20 17:18:01,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {1822#true} assume !(0 == ~cond); {1822#true} is VALID [2022-02-20 17:18:01,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-02-20 17:18:01,171 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1822#true} {1863#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} #84#return; {1863#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} is VALID [2022-02-20 17:18:01,173 INFO L272 TraceCheckUtils]: 28: Hoare triple {1863#(and (= |ULTIMATE.start_main_~p~0#1| 0) (= |ULTIMATE.start_main_~h~0#1| 0))} call __VERIFIER_assert((if 0 == (main_~h~0#1 * main_~h~0#1 * main_~h~0#1 - 12 * main_~h~0#1 * main_~n~0#1 * main_~q~0#1 + 16 * main_~n~0#1 * main_~p~0#1 * main_~q~0#1 - main_~h~0#1 * main_~q~0#1 * main_~q~0#1 - 4 * main_~p~0#1 * main_~q~0#1 * main_~q~0#1 + 12 * main_~h~0#1 * main_~q~0#1 * main_~r~0#1 - 16 * main_~p~0#1 * main_~q~0#1 * main_~r~0#1) % 4294967296 then 1 else 0)); {1912#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:18:01,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {1912#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1916#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:18:01,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {1916#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1823#false} is VALID [2022-02-20 17:18:01,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {1823#false} assume !false; {1823#false} is VALID [2022-02-20 17:18:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 17:18:01,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:18:01,174 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:18:01,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34138191] [2022-02-20 17:18:01,174 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:18:01,175 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101175668] [2022-02-20 17:18:01,175 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101175668] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:18:01,175 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:18:01,175 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:18:01,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49147023] [2022-02-20 17:18:01,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:18:01,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 32 [2022-02-20 17:18:01,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:18:01,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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:18:01,199 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:18:01,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:18:01,200 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:18:01,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:18:01,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:18:01,201 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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)