./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound100.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_unwindbound100.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 376367d14f0ef5deff3321a7267050cf9f2383eb99d0a19dad6a556c0772ff28 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:16:32,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:16:32,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:16:32,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:16:32,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:16:32,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:16:32,557 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:16:32,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:16:32,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:16:32,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:16:32,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:16:32,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:16:32,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:16:32,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:16:32,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:16:32,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:16:32,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:16:32,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:16:32,572 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:16:32,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:16:32,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:16:32,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:16:32,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:16:32,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:16:32,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:16:32,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:16:32,585 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:16:32,586 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:16:32,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:16:32,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:16:32,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:16:32,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:16:32,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:16:32,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:16:32,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:16:32,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:16:32,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:16:32,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:16:32,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:16:32,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:16:32,592 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:16:32,593 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:32,617 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:16:32,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:16:32,618 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:16:32,618 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:16:32,618 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:16:32,619 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:16:32,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:16:32,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:16:32,619 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:16:32,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:16:32,620 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:16:32,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:16:32,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:16:32,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:16:32,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:16:32,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:16:32,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:16:32,621 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:16:32,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:16:32,621 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:16:32,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:16:32,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:16:32,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:16:32,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:16:32,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:16:32,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:16:32,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:16:32,623 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:16:32,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:16:32,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:16:32,624 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:16:32,624 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:16:32,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:16:32,624 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 -> 376367d14f0ef5deff3321a7267050cf9f2383eb99d0a19dad6a556c0772ff28 [2022-02-20 17:16:32,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:16:32,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:16:32,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:16:32,823 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:16:32,823 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:16:32,824 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound100.c [2022-02-20 17:16:32,866 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d57ece398/1fbedafa60264f8e98c3f9165b3a250d/FLAGb3adbcff5 [2022-02-20 17:16:33,265 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:16:33,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound100.c [2022-02-20 17:16:33,269 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d57ece398/1fbedafa60264f8e98c3f9165b3a250d/FLAGb3adbcff5 [2022-02-20 17:16:33,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d57ece398/1fbedafa60264f8e98c3f9165b3a250d [2022-02-20 17:16:33,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:16:33,708 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:16:33,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:16:33,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:16:33,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:16:33,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:16:33" (1/1) ... [2022-02-20 17:16:33,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6abeec45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:33, skipping insertion in model container [2022-02-20 17:16:33,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:16:33" (1/1) ... [2022-02-20 17:16:33,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:16:33,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:16:33,858 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_unwindbound100.c[525,538] [2022-02-20 17:16:33,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:16:33,902 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:16:33,912 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_unwindbound100.c[525,538] [2022-02-20 17:16:33,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:16:33,934 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:16:33,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:33 WrapperNode [2022-02-20 17:16:33,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:16:33,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:16:33,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:16:33,935 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:16:33,939 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:33" (1/1) ... [2022-02-20 17:16:33,943 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:33" (1/1) ... [2022-02-20 17:16:33,963 INFO L137 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2022-02-20 17:16:33,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:16:33,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:16:33,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:16:33,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:16:33,969 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:33" (1/1) ... [2022-02-20 17:16:33,969 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:33" (1/1) ... [2022-02-20 17:16:33,971 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:33" (1/1) ... [2022-02-20 17:16:33,971 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:33" (1/1) ... [2022-02-20 17:16:33,973 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:33" (1/1) ... [2022-02-20 17:16:33,976 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:33" (1/1) ... [2022-02-20 17:16:33,977 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:33" (1/1) ... [2022-02-20 17:16:33,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:16:33,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:16:33,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:16:33,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:16:33,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:33" (1/1) ... [2022-02-20 17:16:33,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:16:33,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:34,003 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:34,018 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:34,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:16:34,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:16:34,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:16:34,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:16:34,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:16:34,034 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:16:34,075 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:16:34,076 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:16:34,336 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:16:34,341 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:16:34,341 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:16:34,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:16:34 BoogieIcfgContainer [2022-02-20 17:16:34,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:16:34,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:16:34,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:16:34,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:16:34,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:16:33" (1/3) ... [2022-02-20 17:16:34,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596d7a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:16:34, skipping insertion in model container [2022-02-20 17:16:34,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:33" (2/3) ... [2022-02-20 17:16:34,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596d7a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:16:34, skipping insertion in model container [2022-02-20 17:16:34,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:16:34" (3/3) ... [2022-02-20 17:16:34,349 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound100.c [2022-02-20 17:16:34,352 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:16:34,364 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:16:34,395 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:16:34,400 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:34,401 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:16:34,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:16:34,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:16:34,418 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:34,418 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:34,419 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:34,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:34,423 INFO L85 PathProgramCache]: Analyzing trace with hash -797370321, now seen corresponding path program 1 times [2022-02-20 17:16:34,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:34,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424215559] [2022-02-20 17:16:34,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:34,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:34,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-02-20 17:16:34,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {33#true} is VALID [2022-02-20 17:16:34,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {34#false} is VALID [2022-02-20 17:16:34,544 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#false} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {34#false} is VALID [2022-02-20 17:16:34,544 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-02-20 17:16:34,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-02-20 17:16:34,545 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#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)); {34#false} is VALID [2022-02-20 17:16:34,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-02-20 17:16:34,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-02-20 17:16:34,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-02-20 17:16:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:16:34,547 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:34,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424215559] [2022-02-20 17:16:34,548 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424215559] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:34,548 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:34,548 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:16:34,552 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030360149] [2022-02-20 17:16:34,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:34,559 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:16:34,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:34,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:34,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:34,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:16:34,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:34,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:16:34,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:16:34,605 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:35,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:35,126 INFO L93 Difference]: Finished difference Result 57 states and 97 transitions. [2022-02-20 17:16:35,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:16:35,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:16:35,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2022-02-20 17:16:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:35,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2022-02-20 17:16:35,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 97 transitions. [2022-02-20 17:16:35,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:35,295 INFO L225 Difference]: With dead ends: 57 [2022-02-20 17:16:35,295 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 17:16:35,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:16:35,302 INFO L933 BasicCegarLoop]: 42 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, 42 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:35,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 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:35,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 17:16:35,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 17:16:35,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:35,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:35,330 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:35,330 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:35,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:35,334 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2022-02-20 17:16:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2022-02-20 17:16:35,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:35,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:35,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 26 states. [2022-02-20 17:16:35,336 INFO L87 Difference]: Start difference. First operand has 26 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 26 states. [2022-02-20 17:16:35,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:35,338 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2022-02-20 17:16:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2022-02-20 17:16:35,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:35,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:35,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:35,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:35,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:35,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2022-02-20 17:16:35,343 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 10 [2022-02-20 17:16:35,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:35,343 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2022-02-20 17:16:35,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2022-02-20 17:16:35,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 17:16:35,344 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:35,345 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:35,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:16:35,345 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:35,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:35,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1698606518, now seen corresponding path program 1 times [2022-02-20 17:16:35,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:35,346 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526590438] [2022-02-20 17:16:35,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:35,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:35,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {207#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {209#(= ~counter~0 0)} is VALID [2022-02-20 17:16:35,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {209#(= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {209#(= ~counter~0 0)} is VALID [2022-02-20 17:16:35,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {209#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {209#(= ~counter~0 0)} is VALID [2022-02-20 17:16:35,393 INFO L290 TraceCheckUtils]: 3: Hoare triple {209#(= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {209#(= ~counter~0 0)} is VALID [2022-02-20 17:16:35,394 INFO L290 TraceCheckUtils]: 4: Hoare triple {209#(= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {210#(= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-20 17:16:35,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#(= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(main_#t~post5#1 < 100);havoc main_#t~post5#1; {208#false} is VALID [2022-02-20 17:16:35,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {208#false} is VALID [2022-02-20 17:16:35,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {208#false} assume !(main_#t~post6#1 < 100);havoc main_#t~post6#1; {208#false} is VALID [2022-02-20 17:16:35,395 INFO L272 TraceCheckUtils]: 8: Hoare triple {208#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)); {208#false} is VALID [2022-02-20 17:16:35,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {208#false} ~cond := #in~cond; {208#false} is VALID [2022-02-20 17:16:35,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {208#false} assume 0 == ~cond; {208#false} is VALID [2022-02-20 17:16:35,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {208#false} assume !false; {208#false} is VALID [2022-02-20 17:16:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:16:35,396 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:35,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526590438] [2022-02-20 17:16:35,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526590438] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:35,396 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:35,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:16:35,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722399285] [2022-02-20 17:16:35,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:35,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 17:16:35,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:35,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:35,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:35,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:16:35,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:35,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:16:35,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:16:35,408 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:38,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:38,088 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-02-20 17:16:38,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:16:38,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 17:16:38,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-02-20 17:16:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-02-20 17:16:38,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-02-20 17:16:38,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:38,241 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:16:38,241 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:16:38,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:16:38,243 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:38,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:16:38,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:16:38,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 17:16:38,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:38,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:38,247 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:38,247 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:38,249 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2022-02-20 17:16:38,249 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2022-02-20 17:16:38,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:38,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:38,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 28 states. [2022-02-20 17:16:38,260 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 28 states. [2022-02-20 17:16:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:38,271 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2022-02-20 17:16:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2022-02-20 17:16:38,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:38,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:38,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:38,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:38,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2022-02-20 17:16:38,274 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 12 [2022-02-20 17:16:38,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:38,274 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2022-02-20 17:16:38,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:38,275 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2022-02-20 17:16:38,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:16:38,275 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:38,275 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:38,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:16:38,276 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:38,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:38,276 INFO L85 PathProgramCache]: Analyzing trace with hash 776097594, now seen corresponding path program 1 times [2022-02-20 17:16:38,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:38,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590933217] [2022-02-20 17:16:38,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:38,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:38,297 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:16:38,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858765707] [2022-02-20 17:16:38,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:38,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:38,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:38,343 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:16:38,367 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:16:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:38,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:16:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:38,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:16:38,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {383#(<= ~counter~0 0)} is VALID [2022-02-20 17:16:38,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {383#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {383#(<= ~counter~0 0)} is VALID [2022-02-20 17:16:38,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {383#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {383#(<= ~counter~0 0)} is VALID [2022-02-20 17:16:38,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {383#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {383#(<= ~counter~0 0)} is VALID [2022-02-20 17:16:38,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {383#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {396#(<= ~counter~0 1)} is VALID [2022-02-20 17:16:38,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {396#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 100);havoc main_#t~post5#1; {396#(<= ~counter~0 1)} is VALID [2022-02-20 17:16:38,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {396#(<= ~counter~0 1)} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {396#(<= ~counter~0 1)} is VALID [2022-02-20 17:16:38,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {396#(<= ~counter~0 1)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {406#(<= |ULTIMATE.start_main_#t~post6#1| 1)} is VALID [2022-02-20 17:16:38,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {406#(<= |ULTIMATE.start_main_#t~post6#1| 1)} assume !(main_#t~post6#1 < 100);havoc main_#t~post6#1; {379#false} is VALID [2022-02-20 17:16:38,583 INFO L272 TraceCheckUtils]: 9: Hoare triple {379#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)); {379#false} is VALID [2022-02-20 17:16:38,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {379#false} ~cond := #in~cond; {379#false} is VALID [2022-02-20 17:16:38,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {379#false} assume 0 == ~cond; {379#false} is VALID [2022-02-20 17:16:38,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {379#false} assume !false; {379#false} is VALID [2022-02-20 17:16:38,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:16:38,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:16:38,584 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:38,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590933217] [2022-02-20 17:16:38,585 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:16:38,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858765707] [2022-02-20 17:16:38,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858765707] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:38,586 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:38,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:16:38,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738839613] [2022-02-20 17:16:38,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:38,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 17:16:38,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:38,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:38,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:38,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:16:38,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:38,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:16:38,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:16:38,606 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:53,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:53,892 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-02-20 17:16:53,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:16:53,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 17:16:53,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-02-20 17:16:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:53,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-02-20 17:16:53,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-02-20 17:16:53,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:53,947 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:16:53,947 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 17:16:53,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:16:53,948 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:53,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 102 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:16:53,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 17:16:53,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-02-20 17:16:53,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:53,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:53,954 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:53,955 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:53,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:53,957 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2022-02-20 17:16:53,957 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2022-02-20 17:16:53,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:53,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:53,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 32 states. [2022-02-20 17:16:53,958 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 32 states. [2022-02-20 17:16:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:53,960 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2022-02-20 17:16:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2022-02-20 17:16:53,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:53,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:53,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:53,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:53,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:16:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2022-02-20 17:16:53,963 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 13 [2022-02-20 17:16:53,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:53,963 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2022-02-20 17:16:53,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:53,963 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2022-02-20 17:16:53,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:16:53,964 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:53,964 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:53,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:16:54,179 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:16:54,180 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:54,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:54,181 INFO L85 PathProgramCache]: Analyzing trace with hash 777587144, now seen corresponding path program 1 times [2022-02-20 17:16:54,181 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:54,181 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747479459] [2022-02-20 17:16:54,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:54,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:54,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {586#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {586#true} is VALID [2022-02-20 17:16:54,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {586#true} is VALID [2022-02-20 17:16:54,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {586#true} assume !(0 == assume_abort_if_not_~cond#1); {586#true} is VALID [2022-02-20 17:16:54,380 INFO L290 TraceCheckUtils]: 3: Hoare triple {586#true} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {588#(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:54,380 INFO L290 TraceCheckUtils]: 4: Hoare triple {588#(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))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {588#(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:54,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {588#(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_#t~post5#1 < 100);havoc main_#t~post5#1; {588#(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:54,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {588#(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); {589#(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))) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:16:54,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {589#(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))) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {589#(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))) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:16:54,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {589#(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))) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} assume !!(main_#t~post6#1 < 100);havoc main_#t~post6#1; {589#(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))) (= (+ (- 1) |ULTIMATE.start_main_~q~0#1|) 0))} is VALID [2022-02-20 17:16:54,384 INFO L272 TraceCheckUtils]: 9: Hoare triple {589#(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))) (= (+ (- 1) |ULTIMATE.start_main_~q~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)); {590#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:16:54,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {590#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {591#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:16:54,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {591#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {587#false} is VALID [2022-02-20 17:16:54,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {587#false} assume !false; {587#false} is VALID [2022-02-20 17:16:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:16:54,385 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:54,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747479459] [2022-02-20 17:16:54,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747479459] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:54,386 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:54,386 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:16:54,386 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717615523] [2022-02-20 17:16:54,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:54,386 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 17:16:54,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:54,387 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:54,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:54,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:16:54,397 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:54,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:16:54,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:16:54,398 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:10,665 INFO L93 Difference]: Finished difference Result 64 states and 96 transitions. [2022-02-20 17:17:10,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:17:10,665 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 17:17:10,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:17:10,666 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-02-20 17:17:10,668 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-02-20 17:17:10,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 96 transitions. [2022-02-20 17:17:10,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:10,765 INFO L225 Difference]: With dead ends: 64 [2022-02-20 17:17:10,765 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 17:17:10,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:10,766 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 181 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.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:17:10,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 181 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 17:17:10,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 17:17:10,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-02-20 17:17:10,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:17:10,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:17:10,785 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:17:10,786 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:17:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:10,788 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2022-02-20 17:17:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2022-02-20 17:17:10,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:10,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:10,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 45 states. [2022-02-20 17:17:10,790 INFO L87 Difference]: Start difference. First operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 45 states. [2022-02-20 17:17:10,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:10,792 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2022-02-20 17:17:10,792 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2022-02-20 17:17:10,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:10,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:10,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:17:10,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:17:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:17:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2022-02-20 17:17:10,795 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 13 [2022-02-20 17:17:10,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:17:10,795 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2022-02-20 17:17:10,795 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:10,795 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2022-02-20 17:17:10,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 17:17:10,796 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:17:10,796 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:17:10,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 17:17:10,796 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:17:10,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:17:10,797 INFO L85 PathProgramCache]: Analyzing trace with hash 84493759, now seen corresponding path program 1 times [2022-02-20 17:17:10,797 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:17:10,797 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605856199] [2022-02-20 17:17:10,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:10,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:17:10,814 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:17:10,815 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [884444434] [2022-02-20 17:17:10,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:10,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:17:10,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:17:10,816 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:10,817 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:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:10,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:17:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:10,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:17:10,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {845#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {850#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:10,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {850#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {850#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:10,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {850#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {850#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:10,939 INFO L290 TraceCheckUtils]: 3: Hoare triple {850#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {850#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:10,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {850#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {863#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:10,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {863#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 100);havoc main_#t~post5#1; {863#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:10,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {863#(<= ~counter~0 1)} assume !!(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296);main_~q~0#1 := 4 * main_~q~0#1; {863#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:10,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {863#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {873#(<= |ULTIMATE.start_main_#t~post5#1| 1)} is VALID [2022-02-20 17:17:10,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume !(main_#t~post5#1 < 100);havoc main_#t~post5#1; {846#false} is VALID [2022-02-20 17:17:10,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {846#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {846#false} is VALID [2022-02-20 17:17:10,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {846#false} assume !(main_#t~post6#1 < 100);havoc main_#t~post6#1; {846#false} is VALID [2022-02-20 17:17:10,943 INFO L272 TraceCheckUtils]: 11: Hoare triple {846#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)); {846#false} is VALID [2022-02-20 17:17:10,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {846#false} ~cond := #in~cond; {846#false} is VALID [2022-02-20 17:17:10,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {846#false} assume 0 == ~cond; {846#false} is VALID [2022-02-20 17:17:10,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {846#false} assume !false; {846#false} is VALID [2022-02-20 17:17:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:17:10,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:17:11,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {846#false} assume !false; {846#false} is VALID [2022-02-20 17:17:11,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {846#false} assume 0 == ~cond; {846#false} is VALID [2022-02-20 17:17:11,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {846#false} ~cond := #in~cond; {846#false} is VALID [2022-02-20 17:17:11,026 INFO L272 TraceCheckUtils]: 11: Hoare triple {846#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)); {846#false} is VALID [2022-02-20 17:17:11,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {846#false} assume !(main_#t~post6#1 < 100);havoc main_#t~post6#1; {846#false} is VALID [2022-02-20 17:17:11,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {846#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {846#false} is VALID [2022-02-20 17:17:11,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {913#(< |ULTIMATE.start_main_#t~post5#1| 100)} assume !(main_#t~post5#1 < 100);havoc main_#t~post5#1; {846#false} is VALID [2022-02-20 17:17:11,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {917#(< ~counter~0 100)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {913#(< |ULTIMATE.start_main_#t~post5#1| 100)} is VALID [2022-02-20 17:17:11,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {917#(< ~counter~0 100)} assume !!(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296);main_~q~0#1 := 4 * main_~q~0#1; {917#(< ~counter~0 100)} is VALID [2022-02-20 17:17:11,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#(< ~counter~0 100)} assume !!(main_#t~post5#1 < 100);havoc main_#t~post5#1; {917#(< ~counter~0 100)} is VALID [2022-02-20 17:17:11,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {927#(< ~counter~0 99)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {917#(< ~counter~0 100)} is VALID [2022-02-20 17:17:11,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {927#(< ~counter~0 99)} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {927#(< ~counter~0 99)} is VALID [2022-02-20 17:17:11,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {927#(< ~counter~0 99)} assume !(0 == assume_abort_if_not_~cond#1); {927#(< ~counter~0 99)} is VALID [2022-02-20 17:17:11,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {927#(< ~counter~0 99)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {927#(< ~counter~0 99)} is VALID [2022-02-20 17:17:11,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {845#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {927#(< ~counter~0 99)} is VALID [2022-02-20 17:17:11,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:17:11,049 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:17:11,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605856199] [2022-02-20 17:17:11,051 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:17:11,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884444434] [2022-02-20 17:17:11,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884444434] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:17:11,051 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:17:11,051 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-02-20 17:17:11,051 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009308133] [2022-02-20 17:17:11,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:17:11,052 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 17:17:11,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:17:11,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:11,066 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:11,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:17:11,067 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:17:11,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:17:11,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:17:11,067 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:20,904 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:23,755 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:31,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 17:17:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:35,462 INFO L93 Difference]: Finished difference Result 98 states and 142 transitions. [2022-02-20 17:17:35,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:17:35,462 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 17:17:35,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:17:35,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2022-02-20 17:17:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:35,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2022-02-20 17:17:35,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 139 transitions. [2022-02-20 17:17:35,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:35,580 INFO L225 Difference]: With dead ends: 98 [2022-02-20 17:17:35,580 INFO L226 Difference]: Without dead ends: 79 [2022-02-20 17:17:35,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:17:35,581 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 22 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-02-20 17:17:35,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 180 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2022-02-20 17:17:35,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-20 17:17:35,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2022-02-20 17:17:35,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:17:35,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 57 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:17:35,610 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 57 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:17:35,611 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 57 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:17:35,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:35,615 INFO L93 Difference]: Finished difference Result 79 states and 110 transitions. [2022-02-20 17:17:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 110 transitions. [2022-02-20 17:17:35,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:35,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:35,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-02-20 17:17:35,619 INFO L87 Difference]: Start difference. First operand has 57 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-02-20 17:17:35,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:17:35,625 INFO L93 Difference]: Finished difference Result 79 states and 110 transitions. [2022-02-20 17:17:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 110 transitions. [2022-02-20 17:17:35,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:17:35,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:17:35,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:17:35,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:17:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:17:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2022-02-20 17:17:35,630 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 15 [2022-02-20 17:17:35,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:17:35,630 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2022-02-20 17:17:35,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2022-02-20 17:17:35,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:17:35,631 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:17:35,631 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:17:35,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 17:17:35,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:17:35,848 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:17:35,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:17:35,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2016757679, now seen corresponding path program 1 times [2022-02-20 17:17:35,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:17:35,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337438140] [2022-02-20 17:17:35,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:35,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:17:35,861 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:17:35,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1612769942] [2022-02-20 17:17:35,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:17:35,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:17:35,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:17:35,870 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:35,873 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:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:35,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:17:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:17:35,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:17:36,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {1330#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1335#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:36,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {1335#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1335#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:36,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {1335#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {1335#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:36,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {1335#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {1335#(<= ~counter~0 0)} is VALID [2022-02-20 17:17:36,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {1335#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1348#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:36,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {1348#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 100);havoc main_#t~post5#1; {1348#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:36,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {1348#(<= ~counter~0 1)} assume !!(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296);main_~q~0#1 := 4 * main_~q~0#1; {1348#(<= ~counter~0 1)} is VALID [2022-02-20 17:17:36,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {1348#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1358#(<= ~counter~0 2)} is VALID [2022-02-20 17:17:36,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {1358#(<= ~counter~0 2)} assume !!(main_#t~post5#1 < 100);havoc main_#t~post5#1; {1358#(<= ~counter~0 2)} is VALID [2022-02-20 17:17:36,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {1358#(<= ~counter~0 2)} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {1358#(<= ~counter~0 2)} is VALID [2022-02-20 17:17:36,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {1358#(<= ~counter~0 2)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1368#(<= |ULTIMATE.start_main_#t~post6#1| 2)} is VALID [2022-02-20 17:17:36,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {1368#(<= |ULTIMATE.start_main_#t~post6#1| 2)} assume !(main_#t~post6#1 < 100);havoc main_#t~post6#1; {1331#false} is VALID [2022-02-20 17:17:36,027 INFO L272 TraceCheckUtils]: 12: Hoare triple {1331#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)); {1331#false} is VALID [2022-02-20 17:17:36,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {1331#false} ~cond := #in~cond; {1331#false} is VALID [2022-02-20 17:17:36,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {1331#false} assume 0 == ~cond; {1331#false} is VALID [2022-02-20 17:17:36,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {1331#false} assume !false; {1331#false} is VALID [2022-02-20 17:17:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:17:36,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:17:36,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {1331#false} assume !false; {1331#false} is VALID [2022-02-20 17:17:36,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {1331#false} assume 0 == ~cond; {1331#false} is VALID [2022-02-20 17:17:36,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {1331#false} ~cond := #in~cond; {1331#false} is VALID [2022-02-20 17:17:36,135 INFO L272 TraceCheckUtils]: 12: Hoare triple {1331#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)); {1331#false} is VALID [2022-02-20 17:17:36,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {1396#(< |ULTIMATE.start_main_#t~post6#1| 100)} assume !(main_#t~post6#1 < 100);havoc main_#t~post6#1; {1331#false} is VALID [2022-02-20 17:17:36,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {1400#(< ~counter~0 100)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1396#(< |ULTIMATE.start_main_#t~post6#1| 100)} is VALID [2022-02-20 17:17:36,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {1400#(< ~counter~0 100)} assume !(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296); {1400#(< ~counter~0 100)} is VALID [2022-02-20 17:17:36,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {1400#(< ~counter~0 100)} assume !!(main_#t~post5#1 < 100);havoc main_#t~post5#1; {1400#(< ~counter~0 100)} is VALID [2022-02-20 17:17:36,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {1410#(< ~counter~0 99)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1400#(< ~counter~0 100)} is VALID [2022-02-20 17:17:36,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {1410#(< ~counter~0 99)} assume !!(main_~q~0#1 % 4294967296 <= main_~n~0#1 % 4294967296);main_~q~0#1 := 4 * main_~q~0#1; {1410#(< ~counter~0 99)} is VALID [2022-02-20 17:17:36,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {1410#(< ~counter~0 99)} assume !!(main_#t~post5#1 < 100);havoc main_#t~post5#1; {1410#(< ~counter~0 99)} is VALID [2022-02-20 17:17:36,138 INFO L290 TraceCheckUtils]: 4: Hoare triple {1420#(< ~counter~0 98)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1410#(< ~counter~0 99)} is VALID [2022-02-20 17:17:36,142 INFO L290 TraceCheckUtils]: 3: Hoare triple {1420#(< ~counter~0 98)} assume { :end_inline_assume_abort_if_not } true;main_~p~0#1 := 0;main_~q~0#1 := 1;main_~r~0#1 := main_~n~0#1;main_~h~0#1 := 0; {1420#(< ~counter~0 98)} is VALID [2022-02-20 17:17:36,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {1420#(< ~counter~0 98)} assume !(0 == assume_abort_if_not_~cond#1); {1420#(< ~counter~0 98)} is VALID [2022-02-20 17:17:36,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {1420#(< ~counter~0 98)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~n~0#1 % 4294967296 < 1073741823 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1420#(< ~counter~0 98)} is VALID [2022-02-20 17:17:36,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {1330#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1420#(< ~counter~0 98)} is VALID [2022-02-20 17:17:36,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:17:36,143 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:17:36,143 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337438140] [2022-02-20 17:17:36,143 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:17:36,144 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612769942] [2022-02-20 17:17:36,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612769942] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:17:36,144 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:17:36,144 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-02-20 17:17:36,144 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108260909] [2022-02-20 17:17:36,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:17:36,144 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 17:17:36,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:17:36,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:36,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:17:36,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:17:36,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:17:36,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:17:36,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:17:36,163 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:17:37,849 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:17:53,567 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []