./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/linear_sea.ch.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/loops/linear_sea.ch.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 eb9784c54ab470258ada67babaf5f63148f3484f17edd94b8d28d55553534fa5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:59:15,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:59:15,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:59:15,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:59:15,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:59:15,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:59:15,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:59:15,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:59:15,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:59:15,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:59:15,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:59:15,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:59:15,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:59:15,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:59:15,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:59:15,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:59:15,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:59:15,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:59:15,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:59:15,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:59:15,154 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:59:15,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:59:15,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:59:15,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:59:15,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:59:15,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:59:15,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:59:15,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:59:15,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:59:15,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:59:15,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:59:15,159 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:59:15,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:59:15,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:59:15,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:59:15,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:59:15,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:59:15,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:59:15,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:59:15,163 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:59:15,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:59:15,167 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:59:15,183 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:59:15,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:59:15,184 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:59:15,184 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:59:15,184 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:59:15,184 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:59:15,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:59:15,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:59:15,185 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:59:15,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:59:15,185 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:59:15,186 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:59:15,186 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:59:15,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:59:15,186 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:59:15,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:59:15,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:59:15,187 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:59:15,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:59:15,187 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:59:15,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:59:15,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:59:15,187 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:59:15,187 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:59:15,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:59:15,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:59:15,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:59:15,188 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:59:15,188 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:59:15,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:59:15,189 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:59:15,189 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:59:15,189 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:59:15,189 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 -> eb9784c54ab470258ada67babaf5f63148f3484f17edd94b8d28d55553534fa5 [2022-02-20 16:59:15,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:59:15,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:59:15,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:59:15,407 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:59:15,407 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:59:15,408 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/linear_sea.ch.c [2022-02-20 16:59:15,471 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18f564af1/b1dcc2ea70b14535b3bfee36bb84f9e6/FLAG0a9ae63fd [2022-02-20 16:59:15,827 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:59:15,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/linear_sea.ch.c [2022-02-20 16:59:15,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18f564af1/b1dcc2ea70b14535b3bfee36bb84f9e6/FLAG0a9ae63fd [2022-02-20 16:59:16,259 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18f564af1/b1dcc2ea70b14535b3bfee36bb84f9e6 [2022-02-20 16:59:16,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:59:16,262 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:59:16,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:59:16,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:59:16,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:59:16,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:59:16" (1/1) ... [2022-02-20 16:59:16,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73dae929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:16, skipping insertion in model container [2022-02-20 16:59:16,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:59:16" (1/1) ... [2022-02-20 16:59:16,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:59:16,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:59:16,406 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/loops/linear_sea.ch.c[383,396] [2022-02-20 16:59:16,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:59:16,427 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:59:16,435 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/loops/linear_sea.ch.c[383,396] [2022-02-20 16:59:16,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:59:16,451 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:59:16,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:16 WrapperNode [2022-02-20 16:59:16,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:59:16,452 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:59:16,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:59:16,453 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:59:16,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:16" (1/1) ... [2022-02-20 16:59:16,463 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:16" (1/1) ... [2022-02-20 16:59:16,480 INFO L137 Inliner]: procedures = 17, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 54 [2022-02-20 16:59:16,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:59:16,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:59:16,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:59:16,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:59:16,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:16" (1/1) ... [2022-02-20 16:59:16,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:16" (1/1) ... [2022-02-20 16:59:16,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:16" (1/1) ... [2022-02-20 16:59:16,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:16" (1/1) ... [2022-02-20 16:59:16,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:16" (1/1) ... [2022-02-20 16:59:16,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:16" (1/1) ... [2022-02-20 16:59:16,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:16" (1/1) ... [2022-02-20 16:59:16,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:59:16,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:59:16,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:59:16,501 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:59:16,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:16" (1/1) ... [2022-02-20 16:59:16,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:59:16,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:16,525 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 16:59:16,528 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 16:59:16,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:59:16,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:59:16,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:59:16,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:59:16,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:59:16,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:59:16,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:59:16,623 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:59:16,624 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:59:16,779 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:59:16,784 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:59:16,784 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:59:16,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:59:16 BoogieIcfgContainer [2022-02-20 16:59:16,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:59:16,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:59:16,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:59:16,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:59:16,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:59:16" (1/3) ... [2022-02-20 16:59:16,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed94aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:59:16, skipping insertion in model container [2022-02-20 16:59:16,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:16" (2/3) ... [2022-02-20 16:59:16,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed94aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:59:16, skipping insertion in model container [2022-02-20 16:59:16,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:59:16" (3/3) ... [2022-02-20 16:59:16,791 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_sea.ch.c [2022-02-20 16:59:16,795 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:59:16,795 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:59:16,822 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:59:16,827 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 16:59:16,827 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:59:16,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:16,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:59:16,839 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:16,839 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:16,841 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:16,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:16,847 INFO L85 PathProgramCache]: Analyzing trace with hash -638920134, now seen corresponding path program 1 times [2022-02-20 16:59:16,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:16,854 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300197471] [2022-02-20 16:59:16,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:16,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:17,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#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(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {19#true} is VALID [2022-02-20 16:59:17,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1, main_~a~0#1.base, main_~a~0#1.offset;~SIZE~0 := 1 + (if main_#t~nondet7#1 % 4294967296 < 0 && 0 != main_#t~nondet7#1 % 4294967296 % 8 then 1 + main_#t~nondet7#1 % 4294967296 / 8 else main_#t~nondet7#1 % 4294967296 / 8);havoc main_#t~nondet7#1; {19#true} is VALID [2022-02-20 16:59:17,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := main_#t~malloc8#1.base, main_#t~malloc8#1.offset, ~SIZE~0, 4, 4 * ~SIZE~0;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {19#true} is VALID [2022-02-20 16:59:17,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {19#true} assume { :end_inline_#Ultimate.meminit } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int(3, main_~a~0#1.base, main_~a~0#1.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4);assume { :begin_inline_linear_search } true;linear_search_#in~a#1.base, linear_search_#in~a#1.offset, linear_search_#in~n#1, linear_search_#in~q#1 := main_~a~0#1.base, main_~a~0#1.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3;havoc linear_search_#res#1;havoc linear_search_#t~post6#1, linear_search_#t~mem4#1, linear_search_#t~short5#1, linear_search_~a#1.base, linear_search_~a#1.offset, linear_search_~n#1, linear_search_~q#1, linear_search_~j~0#1;linear_search_~a#1.base, linear_search_~a#1.offset := linear_search_#in~a#1.base, linear_search_#in~a#1.offset;linear_search_~n#1 := linear_search_#in~n#1;linear_search_~q#1 := linear_search_#in~q#1;linear_search_~j~0#1 := 0; {19#true} is VALID [2022-02-20 16:59:17,057 INFO L290 TraceCheckUtils]: 4: Hoare triple {19#true} assume !true; {20#false} is VALID [2022-02-20 16:59:17,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {20#false} assume linear_search_~j~0#1 % 4294967296 < ~SIZE~0 % 4294967296;linear_search_#res#1 := 1; {20#false} is VALID [2022-02-20 16:59:17,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {20#false} main_#t~ret9#1 := linear_search_#res#1;assume { :end_inline_linear_search } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := main_#t~ret9#1;havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {20#false} is VALID [2022-02-20 16:59:17,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {20#false} assume 0 == __VERIFIER_assert_~cond#1; {20#false} is VALID [2022-02-20 16:59:17,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {20#false} assume !false; {20#false} is VALID [2022-02-20 16:59:17,060 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 16:59:17,060 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:17,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300197471] [2022-02-20 16:59:17,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300197471] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:17,062 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:17,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:59:17,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220556721] [2022-02-20 16:59:17,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:17,069 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:59:17,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:17,074 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:17,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:17,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:59:17,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:17,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:59:17,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:59:17,116 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:17,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:17,149 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-02-20 16:59:17,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:59:17,149 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:59:17,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:17,150 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 31 transitions. [2022-02-20 16:59:17,157 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 31 transitions. [2022-02-20 16:59:17,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 31 transitions. [2022-02-20 16:59:17,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:17,200 INFO L225 Difference]: With dead ends: 25 [2022-02-20 16:59:17,200 INFO L226 Difference]: Without dead ends: 12 [2022-02-20 16:59:17,202 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 16:59:17,206 INFO L933 BasicCegarLoop]: 19 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, 19 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 16:59:17,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:17,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-02-20 16:59:17,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-20 16:59:17,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:17,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:17,233 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:17,233 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:17,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:17,236 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2022-02-20 16:59:17,236 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2022-02-20 16:59:17,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:17,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:17,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-20 16:59:17,238 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-20 16:59:17,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:17,240 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2022-02-20 16:59:17,240 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2022-02-20 16:59:17,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:17,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:17,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:17,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2022-02-20 16:59:17,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2022-02-20 16:59:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:17,243 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2022-02-20 16:59:17,243 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2022-02-20 16:59:17,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:59:17,244 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:17,244 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:17,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:59:17,244 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:17,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:17,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1170584337, now seen corresponding path program 1 times [2022-02-20 16:59:17,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:17,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784368258] [2022-02-20 16:59:17,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:17,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:17,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {91#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(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {91#true} is VALID [2022-02-20 16:59:17,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {91#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1, main_~a~0#1.base, main_~a~0#1.offset;~SIZE~0 := 1 + (if main_#t~nondet7#1 % 4294967296 < 0 && 0 != main_#t~nondet7#1 % 4294967296 % 8 then 1 + main_#t~nondet7#1 % 4294967296 / 8 else main_#t~nondet7#1 % 4294967296 / 8);havoc main_#t~nondet7#1; {91#true} is VALID [2022-02-20 16:59:17,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {91#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := main_#t~malloc8#1.base, main_#t~malloc8#1.offset, ~SIZE~0, 4, 4 * ~SIZE~0;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {91#true} is VALID [2022-02-20 16:59:17,368 INFO L290 TraceCheckUtils]: 3: Hoare triple {91#true} assume { :end_inline_#Ultimate.meminit } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int(3, main_~a~0#1.base, main_~a~0#1.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4);assume { :begin_inline_linear_search } true;linear_search_#in~a#1.base, linear_search_#in~a#1.offset, linear_search_#in~n#1, linear_search_#in~q#1 := main_~a~0#1.base, main_~a~0#1.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3;havoc linear_search_#res#1;havoc linear_search_#t~post6#1, linear_search_#t~mem4#1, linear_search_#t~short5#1, linear_search_~a#1.base, linear_search_~a#1.offset, linear_search_~n#1, linear_search_~q#1, linear_search_~j~0#1;linear_search_~a#1.base, linear_search_~a#1.offset := linear_search_#in~a#1.base, linear_search_#in~a#1.offset;linear_search_~n#1 := linear_search_#in~n#1;linear_search_~q#1 := linear_search_#in~q#1;linear_search_~j~0#1 := 0; {91#true} is VALID [2022-02-20 16:59:17,368 INFO L290 TraceCheckUtils]: 4: Hoare triple {91#true} linear_search_#t~short5#1 := linear_search_~j~0#1 % 4294967296 < linear_search_~n#1 % 4294967296; {91#true} is VALID [2022-02-20 16:59:17,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {91#true} assume !linear_search_#t~short5#1; {91#true} is VALID [2022-02-20 16:59:17,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {91#true} assume !linear_search_#t~short5#1;havoc linear_search_#t~mem4#1;havoc linear_search_#t~short5#1; {91#true} is VALID [2022-02-20 16:59:17,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {91#true} assume linear_search_~j~0#1 % 4294967296 < ~SIZE~0 % 4294967296;linear_search_#res#1 := 1; {93#(= |ULTIMATE.start_linear_search_#res#1| 1)} is VALID [2022-02-20 16:59:17,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {93#(= |ULTIMATE.start_linear_search_#res#1| 1)} main_#t~ret9#1 := linear_search_#res#1;assume { :end_inline_linear_search } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := main_#t~ret9#1;havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {94#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| 1)} is VALID [2022-02-20 16:59:17,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {94#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| 1)} assume 0 == __VERIFIER_assert_~cond#1; {92#false} is VALID [2022-02-20 16:59:17,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {92#false} assume !false; {92#false} is VALID [2022-02-20 16:59:17,374 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 16:59:17,374 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:17,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784368258] [2022-02-20 16:59:17,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784368258] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:17,375 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:17,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:59:17,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119298601] [2022-02-20 16:59:17,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:17,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:59:17,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:17,376 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), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:17,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:17,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:59:17,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:17,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:59:17,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:59:17,388 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:19,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:19,579 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 16:59:19,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:59:19,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:59:19,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:19,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-02-20 16:59:19,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:19,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-02-20 16:59:19,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 17 transitions. [2022-02-20 16:59:19,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:19,604 INFO L225 Difference]: With dead ends: 16 [2022-02-20 16:59:19,604 INFO L226 Difference]: Without dead ends: 12 [2022-02-20 16:59:19,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:59:19,606 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:19,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:19,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-02-20 16:59:19,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-20 16:59:19,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:19,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:19,608 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:19,609 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:19,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:19,613 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-02-20 16:59:19,613 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-02-20 16:59:19,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:19,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:19,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-20 16:59:19,613 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-20 16:59:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:19,614 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-02-20 16:59:19,614 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-02-20 16:59:19,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:19,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:19,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:19,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:19,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:19,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-02-20 16:59:19,615 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 11 [2022-02-20 16:59:19,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:19,615 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-02-20 16:59:19,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:19,616 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-02-20 16:59:19,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:59:19,616 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:19,617 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:19,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:59:19,617 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:19,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:19,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1170643919, now seen corresponding path program 1 times [2022-02-20 16:59:19,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:19,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265723848] [2022-02-20 16:59:19,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:19,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:19,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {156#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(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {156#true} is VALID [2022-02-20 16:59:19,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1, main_~a~0#1.base, main_~a~0#1.offset;~SIZE~0 := 1 + (if main_#t~nondet7#1 % 4294967296 < 0 && 0 != main_#t~nondet7#1 % 4294967296 % 8 then 1 + main_#t~nondet7#1 % 4294967296 / 8 else main_#t~nondet7#1 % 4294967296 / 8);havoc main_#t~nondet7#1; {156#true} is VALID [2022-02-20 16:59:19,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := main_#t~malloc8#1.base, main_#t~malloc8#1.offset, ~SIZE~0, 4, 4 * ~SIZE~0;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {158#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-02-20 16:59:19,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {158#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} assume { :end_inline_#Ultimate.meminit } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int(3, main_~a~0#1.base, main_~a~0#1.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4);assume { :begin_inline_linear_search } true;linear_search_#in~a#1.base, linear_search_#in~a#1.offset, linear_search_#in~n#1, linear_search_#in~q#1 := main_~a~0#1.base, main_~a~0#1.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3;havoc linear_search_#res#1;havoc linear_search_#t~post6#1, linear_search_#t~mem4#1, linear_search_#t~short5#1, linear_search_~a#1.base, linear_search_~a#1.offset, linear_search_~n#1, linear_search_~q#1, linear_search_~j~0#1;linear_search_~a#1.base, linear_search_~a#1.offset := linear_search_#in~a#1.base, linear_search_#in~a#1.offset;linear_search_~n#1 := linear_search_#in~n#1;linear_search_~q#1 := linear_search_#in~q#1;linear_search_~j~0#1 := 0; {159#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |ULTIMATE.start_linear_search_~j~0#1| 0))} is VALID [2022-02-20 16:59:19,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {159#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |ULTIMATE.start_linear_search_~j~0#1| 0))} linear_search_#t~short5#1 := linear_search_~j~0#1 % 4294967296 < linear_search_~n#1 % 4294967296; {159#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |ULTIMATE.start_linear_search_~j~0#1| 0))} is VALID [2022-02-20 16:59:19,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |ULTIMATE.start_linear_search_~j~0#1| 0))} assume !linear_search_#t~short5#1; {159#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |ULTIMATE.start_linear_search_~j~0#1| 0))} is VALID [2022-02-20 16:59:19,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |ULTIMATE.start_linear_search_~j~0#1| 0))} assume !linear_search_#t~short5#1;havoc linear_search_#t~mem4#1;havoc linear_search_#t~short5#1; {159#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |ULTIMATE.start_linear_search_~j~0#1| 0))} is VALID [2022-02-20 16:59:19,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {159#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |ULTIMATE.start_linear_search_~j~0#1| 0))} assume !(linear_search_~j~0#1 % 4294967296 < ~SIZE~0 % 4294967296);linear_search_#res#1 := 0; {157#false} is VALID [2022-02-20 16:59:19,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {157#false} main_#t~ret9#1 := linear_search_#res#1;assume { :end_inline_linear_search } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := main_#t~ret9#1;havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {157#false} is VALID [2022-02-20 16:59:19,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {157#false} assume 0 == __VERIFIER_assert_~cond#1; {157#false} is VALID [2022-02-20 16:59:19,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-02-20 16:59:19,781 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 16:59:19,781 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:19,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265723848] [2022-02-20 16:59:19,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265723848] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:19,783 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:19,783 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:59:19,783 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028651021] [2022-02-20 16:59:19,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:19,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:59:19,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:19,785 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), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:19,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:19,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:59:19,799 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:19,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:59:19,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:59:19,802 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:23,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 16:59:24,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:24,181 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-20 16:59:24,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:59:24,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:59:24,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:24,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-02-20 16:59:24,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:24,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-02-20 16:59:24,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-02-20 16:59:24,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:24,205 INFO L225 Difference]: With dead ends: 20 [2022-02-20 16:59:24,205 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 16:59:24,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:59:24,206 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:24,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 13 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 16:59:24,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 16:59:24,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 16:59:24,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:24,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:24,211 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:24,211 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:24,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:24,212 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 16:59:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 16:59:24,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:24,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:24,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-20 16:59:24,213 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-20 16:59:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:24,214 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 16:59:24,214 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 16:59:24,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:24,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:24,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:24,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:24,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-20 16:59:24,215 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-02-20 16:59:24,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:24,216 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-20 16:59:24,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:24,216 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 16:59:24,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:59:24,216 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:24,217 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:24,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:59:24,217 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:24,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:24,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1445594873, now seen corresponding path program 1 times [2022-02-20 16:59:24,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:24,218 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529918004] [2022-02-20 16:59:24,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:24,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:24,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {234#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(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {234#true} is VALID [2022-02-20 16:59:24,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1, main_~a~0#1.base, main_~a~0#1.offset;~SIZE~0 := 1 + (if main_#t~nondet7#1 % 4294967296 < 0 && 0 != main_#t~nondet7#1 % 4294967296 % 8 then 1 + main_#t~nondet7#1 % 4294967296 / 8 else main_#t~nondet7#1 % 4294967296 / 8);havoc main_#t~nondet7#1; {234#true} is VALID [2022-02-20 16:59:24,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := main_#t~malloc8#1.base, main_#t~malloc8#1.offset, ~SIZE~0, 4, 4 * ~SIZE~0;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {234#true} is VALID [2022-02-20 16:59:24,253 INFO L290 TraceCheckUtils]: 3: Hoare triple {234#true} assume { :end_inline_#Ultimate.meminit } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int(3, main_~a~0#1.base, main_~a~0#1.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4);assume { :begin_inline_linear_search } true;linear_search_#in~a#1.base, linear_search_#in~a#1.offset, linear_search_#in~n#1, linear_search_#in~q#1 := main_~a~0#1.base, main_~a~0#1.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3;havoc linear_search_#res#1;havoc linear_search_#t~post6#1, linear_search_#t~mem4#1, linear_search_#t~short5#1, linear_search_~a#1.base, linear_search_~a#1.offset, linear_search_~n#1, linear_search_~q#1, linear_search_~j~0#1;linear_search_~a#1.base, linear_search_~a#1.offset := linear_search_#in~a#1.base, linear_search_#in~a#1.offset;linear_search_~n#1 := linear_search_#in~n#1;linear_search_~q#1 := linear_search_#in~q#1;linear_search_~j~0#1 := 0; {234#true} is VALID [2022-02-20 16:59:24,253 INFO L290 TraceCheckUtils]: 4: Hoare triple {234#true} linear_search_#t~short5#1 := linear_search_~j~0#1 % 4294967296 < linear_search_~n#1 % 4294967296; {234#true} is VALID [2022-02-20 16:59:24,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} assume !linear_search_#t~short5#1; {236#(not |ULTIMATE.start_linear_search_#t~short5#1|)} is VALID [2022-02-20 16:59:24,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#(not |ULTIMATE.start_linear_search_#t~short5#1|)} assume !!linear_search_#t~short5#1;havoc linear_search_#t~mem4#1;havoc linear_search_#t~short5#1;linear_search_#t~post6#1 := linear_search_~j~0#1;linear_search_~j~0#1 := 1 + linear_search_#t~post6#1;havoc linear_search_#t~post6#1; {235#false} is VALID [2022-02-20 16:59:24,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {235#false} linear_search_#t~short5#1 := linear_search_~j~0#1 % 4294967296 < linear_search_~n#1 % 4294967296; {235#false} is VALID [2022-02-20 16:59:24,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#false} assume !linear_search_#t~short5#1; {235#false} is VALID [2022-02-20 16:59:24,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} assume !linear_search_#t~short5#1;havoc linear_search_#t~mem4#1;havoc linear_search_#t~short5#1; {235#false} is VALID [2022-02-20 16:59:24,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume !(linear_search_~j~0#1 % 4294967296 < ~SIZE~0 % 4294967296);linear_search_#res#1 := 0; {235#false} is VALID [2022-02-20 16:59:24,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} main_#t~ret9#1 := linear_search_#res#1;assume { :end_inline_linear_search } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := main_#t~ret9#1;havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {235#false} is VALID [2022-02-20 16:59:24,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {235#false} assume 0 == __VERIFIER_assert_~cond#1; {235#false} is VALID [2022-02-20 16:59:24,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-02-20 16:59:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:24,255 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:24,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529918004] [2022-02-20 16:59:24,255 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529918004] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:24,255 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:24,255 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:59:24,255 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427035394] [2022-02-20 16:59:24,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:24,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:59:24,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:24,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:24,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:24,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:59:24,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:24,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:59:24,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:59:24,267 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:26,279 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 16:59:26,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:26,451 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-02-20 16:59:26,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:59:26,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:59:26,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:26,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:26,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-20 16:59:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:26,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-20 16:59:26,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2022-02-20 16:59:26,472 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 16:59:26,473 INFO L225 Difference]: With dead ends: 25 [2022-02-20 16:59:26,473 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 16:59:26,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:59:26,474 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:26,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 16:59:26,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 16:59:26,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 16:59:26,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:26,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:26,480 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:26,480 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:26,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:26,481 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 16:59:26,481 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 16:59:26,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:26,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:26,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 16:59:26,484 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 16:59:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:26,490 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 16:59:26,490 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 16:59:26,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:26,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:26,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:26,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:26,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-02-20 16:59:26,493 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2022-02-20 16:59:26,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:26,493 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-02-20 16:59:26,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 16:59:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:59:26,505 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:26,505 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:26,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:59:26,506 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:26,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:26,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2125653243, now seen corresponding path program 1 times [2022-02-20 16:59:26,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:26,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018876801] [2022-02-20 16:59:26,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:26,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:26,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {320#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(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {320#true} is VALID [2022-02-20 16:59:26,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {320#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~ret9#1, main_~a~0#1.base, main_~a~0#1.offset;~SIZE~0 := 1 + (if main_#t~nondet7#1 % 4294967296 < 0 && 0 != main_#t~nondet7#1 % 4294967296 % 8 then 1 + main_#t~nondet7#1 % 4294967296 / 8 else main_#t~nondet7#1 % 4294967296 / 8);havoc main_#t~nondet7#1; {320#true} is VALID [2022-02-20 16:59:26,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {320#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := main_#t~malloc8#1.base, main_#t~malloc8#1.offset, ~SIZE~0, 4, 4 * ~SIZE~0;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {322#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-02-20 16:59:26,651 INFO L290 TraceCheckUtils]: 3: Hoare triple {322#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} assume { :end_inline_#Ultimate.meminit } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call write~int(3, main_~a~0#1.base, main_~a~0#1.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4);assume { :begin_inline_linear_search } true;linear_search_#in~a#1.base, linear_search_#in~a#1.offset, linear_search_#in~n#1, linear_search_#in~q#1 := main_~a~0#1.base, main_~a~0#1.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3;havoc linear_search_#res#1;havoc linear_search_#t~post6#1, linear_search_#t~mem4#1, linear_search_#t~short5#1, linear_search_~a#1.base, linear_search_~a#1.offset, linear_search_~n#1, linear_search_~q#1, linear_search_~j~0#1;linear_search_~a#1.base, linear_search_~a#1.offset := linear_search_#in~a#1.base, linear_search_#in~a#1.offset;linear_search_~n#1 := linear_search_#in~n#1;linear_search_~q#1 := linear_search_#in~q#1;linear_search_~j~0#1 := 0; {323#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |ULTIMATE.start_linear_search_~j~0#1| 0))} is VALID [2022-02-20 16:59:26,655 INFO L290 TraceCheckUtils]: 4: Hoare triple {323#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |ULTIMATE.start_linear_search_~j~0#1| 0))} linear_search_#t~short5#1 := linear_search_~j~0#1 % 4294967296 < linear_search_~n#1 % 4294967296; {323#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |ULTIMATE.start_linear_search_~j~0#1| 0))} is VALID [2022-02-20 16:59:26,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {323#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |ULTIMATE.start_linear_search_~j~0#1| 0))} assume linear_search_#t~short5#1;call linear_search_#t~mem4#1 := read~int(linear_search_~a#1.base, linear_search_~a#1.offset + 4 * (if linear_search_~j~0#1 % 4294967296 % 4294967296 <= 2147483647 then linear_search_~j~0#1 % 4294967296 % 4294967296 else linear_search_~j~0#1 % 4294967296 % 4294967296 - 4294967296), 4);linear_search_#t~short5#1 := linear_search_#t~mem4#1 != linear_search_~q#1; {323#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |ULTIMATE.start_linear_search_~j~0#1| 0))} is VALID [2022-02-20 16:59:26,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {323#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |ULTIMATE.start_linear_search_~j~0#1| 0))} assume !!linear_search_#t~short5#1;havoc linear_search_#t~mem4#1;havoc linear_search_#t~short5#1;linear_search_#t~post6#1 := linear_search_~j~0#1;linear_search_~j~0#1 := 1 + linear_search_#t~post6#1;havoc linear_search_#t~post6#1; {324#(and (<= (+ |ULTIMATE.start_linear_search_~j~0#1| (* (div ~SIZE~0 4294967296) 4294967296) 1) ~SIZE~0) (not (<= (+ (div |ULTIMATE.start_linear_search_~j~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 16:59:26,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {324#(and (<= (+ |ULTIMATE.start_linear_search_~j~0#1| (* (div ~SIZE~0 4294967296) 4294967296) 1) ~SIZE~0) (not (<= (+ (div |ULTIMATE.start_linear_search_~j~0#1| 4294967296) 1) 0)))} linear_search_#t~short5#1 := linear_search_~j~0#1 % 4294967296 < linear_search_~n#1 % 4294967296; {324#(and (<= (+ |ULTIMATE.start_linear_search_~j~0#1| (* (div ~SIZE~0 4294967296) 4294967296) 1) ~SIZE~0) (not (<= (+ (div |ULTIMATE.start_linear_search_~j~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 16:59:26,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {324#(and (<= (+ |ULTIMATE.start_linear_search_~j~0#1| (* (div ~SIZE~0 4294967296) 4294967296) 1) ~SIZE~0) (not (<= (+ (div |ULTIMATE.start_linear_search_~j~0#1| 4294967296) 1) 0)))} assume !linear_search_#t~short5#1; {324#(and (<= (+ |ULTIMATE.start_linear_search_~j~0#1| (* (div ~SIZE~0 4294967296) 4294967296) 1) ~SIZE~0) (not (<= (+ (div |ULTIMATE.start_linear_search_~j~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 16:59:26,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {324#(and (<= (+ |ULTIMATE.start_linear_search_~j~0#1| (* (div ~SIZE~0 4294967296) 4294967296) 1) ~SIZE~0) (not (<= (+ (div |ULTIMATE.start_linear_search_~j~0#1| 4294967296) 1) 0)))} assume !linear_search_#t~short5#1;havoc linear_search_#t~mem4#1;havoc linear_search_#t~short5#1; {324#(and (<= (+ |ULTIMATE.start_linear_search_~j~0#1| (* (div ~SIZE~0 4294967296) 4294967296) 1) ~SIZE~0) (not (<= (+ (div |ULTIMATE.start_linear_search_~j~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 16:59:26,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {324#(and (<= (+ |ULTIMATE.start_linear_search_~j~0#1| (* (div ~SIZE~0 4294967296) 4294967296) 1) ~SIZE~0) (not (<= (+ (div |ULTIMATE.start_linear_search_~j~0#1| 4294967296) 1) 0)))} assume !(linear_search_~j~0#1 % 4294967296 < ~SIZE~0 % 4294967296);linear_search_#res#1 := 0; {321#false} is VALID [2022-02-20 16:59:26,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {321#false} main_#t~ret9#1 := linear_search_#res#1;assume { :end_inline_linear_search } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := main_#t~ret9#1;havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {321#false} is VALID [2022-02-20 16:59:26,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {321#false} assume 0 == __VERIFIER_assert_~cond#1; {321#false} is VALID [2022-02-20 16:59:26,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {321#false} assume !false; {321#false} is VALID [2022-02-20 16:59:26,664 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 16:59:26,665 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:26,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018876801] [2022-02-20 16:59:26,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018876801] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:59:26,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519200685] [2022-02-20 16:59:26,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:26,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:26,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:26,676 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 16:59:26,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process