/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:47:23,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:47:23,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:47:23,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:47:23,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:47:23,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:47:23,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:47:23,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:47:23,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:47:23,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:47:23,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:47:23,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:47:23,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:47:23,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:47:23,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:47:23,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:47:23,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:47:23,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:47:23,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:47:23,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:47:23,116 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:47:23,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:47:23,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:47:23,119 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:47:23,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:47:23,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:47:23,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:47:23,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:47:23,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:47:23,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:47:23,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:47:23,122 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:47:23,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:47:23,123 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:47:23,124 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:47:23,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:47:23,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:47:23,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:47:23,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:47:23,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:47:23,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:47:23,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:47:23,129 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:47:23,153 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:47:23,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:47:23,155 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:47:23,155 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:47:23,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:47:23,156 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:47:23,156 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:47:23,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:47:23,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:47:23,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:47:23,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:47:23,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:47:23,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:47:23,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:47:23,157 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:47:23,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:47:23,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:47:23,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:47:23,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:47:23,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:47:23,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:47:23,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:47:23,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:47:23,159 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:47:23,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:47:23,159 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:47:23,159 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:47:23,159 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:47:23,160 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:47:23,161 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 00:47:23,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:47:23,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:47:23,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:47:23,374 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:47:23,379 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:47:23,380 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c [2022-04-15 00:47:23,423 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e613a8a/9c5bff2827fb4a6694fb19742f50ab5b/FLAGbf8f859d2 [2022-04-15 00:47:23,756 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:47:23,756 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c [2022-04-15 00:47:23,763 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e613a8a/9c5bff2827fb4a6694fb19742f50ab5b/FLAGbf8f859d2 [2022-04-15 00:47:24,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e613a8a/9c5bff2827fb4a6694fb19742f50ab5b [2022-04-15 00:47:24,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:47:24,181 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:47:24,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:47:24,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:47:24,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:47:24,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:47:24" (1/1) ... [2022-04-15 00:47:24,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a1467ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:24, skipping insertion in model container [2022-04-15 00:47:24,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:47:24" (1/1) ... [2022-04-15 00:47:24,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:47:24,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:47:24,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c[2265,2278] [2022-04-15 00:47:24,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:47:24,370 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:47:24,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c[2265,2278] [2022-04-15 00:47:24,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:47:24,397 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:47:24,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:24 WrapperNode [2022-04-15 00:47:24,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:47:24,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:47:24,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:47:24,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:47:24,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:24" (1/1) ... [2022-04-15 00:47:24,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:24" (1/1) ... [2022-04-15 00:47:24,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:24" (1/1) ... [2022-04-15 00:47:24,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:24" (1/1) ... [2022-04-15 00:47:24,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:24" (1/1) ... [2022-04-15 00:47:24,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:24" (1/1) ... [2022-04-15 00:47:24,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:24" (1/1) ... [2022-04-15 00:47:24,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:47:24,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:47:24,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:47:24,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:47:24,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:24" (1/1) ... [2022-04-15 00:47:24,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:47:24,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:47:24,453 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-04-15 00:47:24,454 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-04-15 00:47:24,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:47:24,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:47:24,485 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:47:24,485 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:47:24,485 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:47:24,485 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:47:24,485 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:47:24,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:47:24,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 00:47:24,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:47:24,487 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:47:24,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:47:24,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:47:24,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:47:24,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:47:24,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:47:24,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:47:24,574 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:47:24,575 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:47:33,506 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:47:33,513 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:47:33,513 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-15 00:47:33,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:47:33 BoogieIcfgContainer [2022-04-15 00:47:33,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:47:33,515 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:47:33,515 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:47:33,518 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:47:33,520 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:47:33" (1/1) ... [2022-04-15 00:47:33,521 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:47:33,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:47:33 BasicIcfg [2022-04-15 00:47:33,541 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:47:33,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:47:33,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:47:33,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:47:33,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:47:24" (1/4) ... [2022-04-15 00:47:33,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc6d968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:47:33, skipping insertion in model container [2022-04-15 00:47:33,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:47:24" (2/4) ... [2022-04-15 00:47:33,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc6d968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:47:33, skipping insertion in model container [2022-04-15 00:47:33,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:47:33" (3/4) ... [2022-04-15 00:47:33,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc6d968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:47:33, skipping insertion in model container [2022-04-15 00:47:33,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:47:33" (4/4) ... [2022-04-15 00:47:33,545 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.c.v+lhb-reducer.cqvasr [2022-04-15 00:47:33,548 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:47:33,548 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:47:33,574 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:47:33,578 INFO L340 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=FINITE_AUTOMATA, 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 [2022-04-15 00:47:33,578 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:47:33,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:47:33,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 00:47:33,592 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:47:33,593 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:47:33,593 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:47:33,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:47:33,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1219544613, now seen corresponding path program 1 times [2022-04-15 00:47:33,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:47:33,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68818407] [2022-04-15 00:47:33,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:47:33,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:47:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:47:34,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:47:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:47:34,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {31#true} is VALID [2022-04-15 00:47:34,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-15 00:47:34,123 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-15 00:47:34,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:47:34,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {31#true} is VALID [2022-04-15 00:47:34,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-15 00:47:34,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-15 00:47:34,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-15 00:47:34,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} [79] mainENTRY-->L83: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__x~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__y~0_1 1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-15 00:47:34,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} [81] L83-->L23: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-15 00:47:34,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} [82] L23-->L25: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-15 00:47:36,241 WARN L290 TraceCheckUtils]: 8: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} [84] L25-->L44: Formula: (and (= 0 v_main_~main__y~0_2) (= (+ 2 v_main_~main__x~0_3) v_main_~main__x~0_2) (= (mod (mod (mod v_main_~main__x~0_3 4294967296) 3) 4294967296) 1) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_112_0~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{~__tmp_112_0~0=v_~__tmp_112_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[~__tmp_112_0~0, main_~main__x~0, main_~main__y~0] {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-15 00:47:36,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [87] L44-->L56: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 v_~__tmp_94_0~0_1) (= v_main_~main____CPAchecker_TMP_0~0_7 v_~__tmp_112_0~0_2)) InVars {~__tmp_112_0~0=v_~__tmp_112_0~0_2} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_1, ~__tmp_112_0~0=v_~__tmp_112_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} AuxVars[] AssignedVars[~__tmp_94_0~0, main_~main____CPAchecker_TMP_0~0] {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 00:47:36,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [90] L56-->L37: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet6_2|) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_94_0~0_2) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~1, main_~main____CPAchecker_TMP_0~0] {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 00:47:36,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [95] L37-->L90: Formula: (= v_main_~main____CPAchecker_TMP_0~1_11 0) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} AuxVars[] AssignedVars[] {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 00:47:36,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [100] L90-->L97: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (mod v_main_~main__y~0_7 4294967296) 0) (= (ite (= (mod (mod (mod v_main_~main__x~0_14 4294967296) 3) 4294967296) 0) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {38#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-15 00:47:36,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(not (= main_~__VERIFIER_assert__cond~0 0))} [104] L97-->L99: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-15 00:47:36,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} [108] L99-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-15 00:47:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:47:36,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:47:36,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68818407] [2022-04-15 00:47:36,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68818407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:47:36,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:47:36,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:47:36,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307111380] [2022-04-15 00:47:36,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:47:36,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 00:47:36,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:47:36,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:47:38,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 00:47:38,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:47:38,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:47:38,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:47:38,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:47:38,512 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:47:42,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:47:47,280 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:47:49,490 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:47:56,321 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:47:58,492 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:48:02,895 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:48:05,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:48:11,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:48:13,816 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:48:15,979 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:48:18,154 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:48:20,370 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:48:22,536 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:48:24,793 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:48:26,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:48:27,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:48:27,148 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2022-04-15 00:48:27,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:48:27,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 00:48:27,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:48:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:48:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-15 00:48:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:48:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-15 00:48:27,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2022-04-15 00:48:29,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 98 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 00:48:29,388 INFO L225 Difference]: With dead ends: 71 [2022-04-15 00:48:29,389 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 00:48:29,390 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 00:48:29,393 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.4s IncrementalHoareTripleChecker+Time [2022-04-15 00:48:29,393 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 95 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 15 Unknown, 0 Unchecked, 32.4s Time] [2022-04-15 00:48:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 00:48:29,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-15 00:48:29,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:48:29,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:48:29,417 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:48:29,417 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:48:29,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:48:29,420 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-15 00:48:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-15 00:48:29,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:48:29,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:48:29,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 00:48:29,421 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 00:48:29,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:48:29,423 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-15 00:48:29,423 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-15 00:48:29,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:48:29,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:48:29,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:48:29,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:48:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:48:29,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-04-15 00:48:29,426 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 15 [2022-04-15 00:48:29,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:48:29,426 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-04-15 00:48:29,426 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:48:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-15 00:48:29,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 00:48:29,427 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:48:29,427 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:48:29,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:48:29,427 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:48:29,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:48:29,428 INFO L85 PathProgramCache]: Analyzing trace with hash -791971888, now seen corresponding path program 1 times [2022-04-15 00:48:29,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:48:29,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2483403] [2022-04-15 00:48:29,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:48:29,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:48:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:48:29,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:48:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:48:29,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {259#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {251#true} is VALID [2022-04-15 00:48:29,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-15 00:48:29,835 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {251#true} {251#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-15 00:48:29,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {259#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:48:29,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {259#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {251#true} is VALID [2022-04-15 00:48:29,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-15 00:48:29,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-15 00:48:29,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-15 00:48:29,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} [79] mainENTRY-->L83: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__x~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__y~0_1 1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-15 00:48:29,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} [81] L83-->L23: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-15 00:48:29,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} [82] L23-->L25: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-15 00:48:29,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} [85] L25-->L117: Formula: (not (= (mod (mod (mod v_main_~main__x~0_15 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_15} OutVars{main_~main__x~0=v_main_~main__x~0_15} AuxVars[] AssignedVars[] {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-15 00:48:32,007 WARN L290 TraceCheckUtils]: 9: Hoare triple {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} [88] L117-->L122: Formula: (and (= 0 v_main_~main__y~0_9) (= (mod (mod (mod v_main_~main__x~0_17 4294967296) 3) 4294967296) 2) (= v_main_~main____CPAchecker_TMP_0~0_9 v_~__tmp_93_0~0_3) (= (+ v_main_~main__x~0_17 1) v_main_~main__x~0_16)) InVars {main_~main__x~0=v_main_~main__x~0_17, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_9} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_9, main_~main__x~0=v_main_~main__x~0_16, ~__tmp_93_0~0=v_~__tmp_93_0~0_3, main_~main__y~0=v_main_~main__y~0_9} AuxVars[] AssignedVars[~__tmp_93_0~0, main_~main__x~0, main_~main__y~0] {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-15 00:48:32,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [91] L122-->L56: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_6 v_~__tmp_93_0~0_2) (= v_main_~main____CPAchecker_TMP_0~1_6 v_~__tmp_94_0~0_3)) InVars {~__tmp_93_0~0=v_~__tmp_93_0~0_2} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_3, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_6, ~__tmp_93_0~0=v_~__tmp_93_0~0_2} AuxVars[] AssignedVars[~__tmp_94_0~0, main_~main____CPAchecker_TMP_0~1] {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 00:48:32,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [90] L56-->L37: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet6_2|) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_94_0~0_2) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~1, main_~main____CPAchecker_TMP_0~0] {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 00:48:32,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [95] L37-->L90: Formula: (= v_main_~main____CPAchecker_TMP_0~1_11 0) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} AuxVars[] AssignedVars[] {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 00:48:32,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [100] L90-->L97: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (mod v_main_~main__y~0_7 4294967296) 0) (= (ite (= (mod (mod (mod v_main_~main__x~0_14 4294967296) 3) 4294967296) 0) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {258#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-15 00:48:32,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {258#(not (= main_~__VERIFIER_assert__cond~0 0))} [104] L97-->L99: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {252#false} is VALID [2022-04-15 00:48:32,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {252#false} [108] L99-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {252#false} is VALID [2022-04-15 00:48:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:48:32,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:48:32,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2483403] [2022-04-15 00:48:32,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2483403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:48:32,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:48:32,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:48:32,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341354233] [2022-04-15 00:48:32,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:48:32,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 00:48:32,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:48:32,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:48:34,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 00:48:34,202 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:48:34,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:48:34,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:48:34,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:48:34,203 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:48:36,356 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:48:38,496 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:48:40,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:48:42,782 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:48:53,578 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:48:56,100 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:48:58,401 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:49:00,562 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:49:02,742 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:49:07,094 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:49:09,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:49:11,609 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:49:13,786 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:49:15,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:49:18,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:49:22,316 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:49:24,510 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:49:26,660 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:49:33,144 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:49:37,510 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:49:39,668 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:49:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:44,169 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2022-04-15 00:49:44,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 00:49:44,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 00:49:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:49:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-15 00:49:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-15 00:49:44,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-04-15 00:49:46,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 73 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 00:49:46,422 INFO L225 Difference]: With dead ends: 60 [2022-04-15 00:49:46,422 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 00:49:46,423 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 00:49:46,423 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.7s IncrementalHoareTripleChecker+Time [2022-04-15 00:49:46,424 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 79 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 21 Unknown, 0 Unchecked, 44.7s Time] [2022-04-15 00:49:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 00:49:46,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-04-15 00:49:46,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:49:46,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:46,435 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:46,435 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:46,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:46,437 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-15 00:49:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-15 00:49:46,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:49:46,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:49:46,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 00:49:46,438 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 00:49:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:49:46,439 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-15 00:49:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-15 00:49:46,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:49:46,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:49:46,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:49:46,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:49:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-15 00:49:46,441 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 16 [2022-04-15 00:49:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:49:46,441 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-15 00:49:46,442 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-15 00:49:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 00:49:46,442 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:49:46,442 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:49:46,442 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:49:46,442 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:49:46,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:49:46,443 INFO L85 PathProgramCache]: Analyzing trace with hash 364986418, now seen corresponding path program 1 times [2022-04-15 00:49:46,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:49:46,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018055821] [2022-04-15 00:49:46,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:49:46,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:49:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:46,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:49:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:49:46,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {484#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {477#true} is VALID [2022-04-15 00:49:46,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID [2022-04-15 00:49:46,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {477#true} {477#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID [2022-04-15 00:49:46,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {477#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {484#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:49:46,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {477#true} is VALID [2022-04-15 00:49:46,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {477#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID [2022-04-15 00:49:46,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {477#true} {477#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID [2022-04-15 00:49:46,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {477#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID [2022-04-15 00:49:46,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {477#true} [79] mainENTRY-->L83: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__x~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__y~0_1 1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {477#true} is VALID [2022-04-15 00:49:46,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {477#true} [81] L83-->L23: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {477#true} is VALID [2022-04-15 00:49:46,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {477#true} [82] L23-->L25: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {477#true} is VALID [2022-04-15 00:49:46,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {477#true} [85] L25-->L117: Formula: (not (= (mod (mod (mod v_main_~main__x~0_15 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_15} OutVars{main_~main__x~0=v_main_~main__x~0_15} AuxVars[] AssignedVars[] {477#true} is VALID [2022-04-15 00:49:46,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {477#true} [89] L117-->L128: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (not (= 2 (mod (mod (mod v_main_~main__x~0_18 4294967296) 3) 4294967296))) (= v_main_~main____CPAchecker_TMP_1~1_1 |v_main_#t~nondet8_2|)) InVars {main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__x~0=v_main_~main__x~0_18} OutVars{main_~main__x~0=v_main_~main__x~0_18, main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~1, main_#t~nondet8] {477#true} is VALID [2022-04-15 00:49:46,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {477#true} [92] L128-->L134: Formula: (and (= (+ v_main_~main__x~0_20 4) v_main_~main__x~0_19) (= v_main_~main__y~0_10 1) (= v_main_~main____CPAchecker_TMP_1~1_3 v_~__tmp_88_1~0_3) (= v_~__tmp_88_0~0_3 v_main_~main____CPAchecker_TMP_0~0_10) (not (= v_main_~main____CPAchecker_TMP_1~1_3 0))) InVars {main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_10, main_~main__x~0=v_main_~main__x~0_20} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_3, main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_10, ~__tmp_88_1~0=v_~__tmp_88_1~0_3, main_~main__x~0=v_main_~main__x~0_19, main_~main__y~0=v_main_~main__y~0_10} AuxVars[] AssignedVars[~__tmp_88_0~0, ~__tmp_88_1~0, main_~main__x~0, main_~main__y~0] {477#true} is VALID [2022-04-15 00:49:46,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {477#true} [96] L134-->L83: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 v_~__tmp_88_1~0_2) (= v_main_~main____CPAchecker_TMP_0~1_8 v_~__tmp_88_0~0_2)) InVars {~__tmp_88_1~0=v_~__tmp_88_1~0_2, ~__tmp_88_0~0=v_~__tmp_88_0~0_2} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_2, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_8, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, ~__tmp_88_1~0=v_~__tmp_88_1~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_~main____CPAchecker_TMP_1~0] {477#true} is VALID [2022-04-15 00:49:46,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {477#true} [81] L83-->L23: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {477#true} is VALID [2022-04-15 00:49:46,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {477#true} [82] L23-->L25: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {477#true} is VALID [2022-04-15 00:49:48,846 WARN L290 TraceCheckUtils]: 14: Hoare triple {477#true} [84] L25-->L44: Formula: (and (= 0 v_main_~main__y~0_2) (= (+ 2 v_main_~main__x~0_3) v_main_~main__x~0_2) (= (mod (mod (mod v_main_~main__x~0_3 4294967296) 3) 4294967296) 1) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_112_0~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{~__tmp_112_0~0=v_~__tmp_112_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[~__tmp_112_0~0, main_~main__x~0, main_~main__y~0] {482#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-15 00:49:48,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {482#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [87] L44-->L56: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 v_~__tmp_94_0~0_1) (= v_main_~main____CPAchecker_TMP_0~0_7 v_~__tmp_112_0~0_2)) InVars {~__tmp_112_0~0=v_~__tmp_112_0~0_2} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_1, ~__tmp_112_0~0=v_~__tmp_112_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} AuxVars[] AssignedVars[~__tmp_94_0~0, main_~main____CPAchecker_TMP_0~0] {482#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 00:49:48,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {482#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [90] L56-->L37: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet6_2|) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_94_0~0_2) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~1, main_~main____CPAchecker_TMP_0~0] {482#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 00:49:48,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {482#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [95] L37-->L90: Formula: (= v_main_~main____CPAchecker_TMP_0~1_11 0) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} AuxVars[] AssignedVars[] {482#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 00:49:48,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {482#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [100] L90-->L97: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (mod v_main_~main__y~0_7 4294967296) 0) (= (ite (= (mod (mod (mod v_main_~main__x~0_14 4294967296) 3) 4294967296) 0) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {483#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-15 00:49:48,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {483#(not (= main_~__VERIFIER_assert__cond~0 0))} [104] L97-->L99: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {478#false} is VALID [2022-04-15 00:49:48,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {478#false} [108] L99-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#false} is VALID [2022-04-15 00:49:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 00:49:48,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:49:48,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018055821] [2022-04-15 00:49:48,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018055821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:49:48,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:49:48,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 00:49:48,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149168839] [2022-04-15 00:49:48,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:49:48,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 00:49:48,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:49:48,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:51,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 00:49:51,047 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 00:49:51,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:49:51,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 00:49:51,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 00:49:51,048 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:49:55,263 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:49:57,431 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:50:01,799 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:50:06,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:50:08,343 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:50:10,616 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:50:15,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:50:19,377 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:50:21,545 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:50:23,710 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:50:28,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:50:32,375 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:50:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:50:32,627 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-04-15 00:50:32,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 00:50:32,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 00:50:32,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:50:32,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:50:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-15 00:50:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:50:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-15 00:50:32,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2022-04-15 00:50:37,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 72 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 00:50:37,079 INFO L225 Difference]: With dead ends: 65 [2022-04-15 00:50:37,079 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 00:50:37,080 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:50:37,080 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:50:37,080 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 56 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 12 Unknown, 0 Unchecked, 25.0s Time] [2022-04-15 00:50:37,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 00:50:37,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-04-15 00:50:37,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:50:37,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:50:37,100 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:50:37,100 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:50:37,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:50:37,101 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-15 00:50:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-15 00:50:37,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:50:37,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:50:37,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 00:50:37,102 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 00:50:37,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:50:37,103 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-15 00:50:37,103 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-15 00:50:37,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:50:37,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:50:37,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:50:37,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:50:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:50:37,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-15 00:50:37,105 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 21 [2022-04-15 00:50:37,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:50:37,105 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-15 00:50:37,105 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:50:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-15 00:50:37,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 00:50:37,106 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:50:37,106 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:50:37,106 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 00:50:37,106 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:50:37,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:50:37,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1083849817, now seen corresponding path program 1 times [2022-04-15 00:50:37,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:50:37,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775447552] [2022-04-15 00:50:37,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:50:37,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:50:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:50:37,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:50:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:50:37,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {722#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {715#true} is VALID [2022-04-15 00:50:37,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {715#true} is VALID [2022-04-15 00:50:37,274 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {715#true} {715#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {715#true} is VALID [2022-04-15 00:50:37,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {715#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {722#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:50:37,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {722#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {715#true} is VALID [2022-04-15 00:50:37,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {715#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {715#true} is VALID [2022-04-15 00:50:37,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715#true} {715#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {715#true} is VALID [2022-04-15 00:50:37,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {715#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {715#true} is VALID [2022-04-15 00:50:37,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {715#true} [79] mainENTRY-->L83: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__x~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__y~0_1 1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {715#true} is VALID [2022-04-15 00:50:37,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {715#true} [81] L83-->L23: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {715#true} is VALID [2022-04-15 00:50:37,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {715#true} [82] L23-->L25: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {715#true} is VALID [2022-04-15 00:50:37,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {715#true} [85] L25-->L117: Formula: (not (= (mod (mod (mod v_main_~main__x~0_15 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_15} OutVars{main_~main__x~0=v_main_~main__x~0_15} AuxVars[] AssignedVars[] {715#true} is VALID [2022-04-15 00:50:37,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {715#true} [89] L117-->L128: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (not (= 2 (mod (mod (mod v_main_~main__x~0_18 4294967296) 3) 4294967296))) (= v_main_~main____CPAchecker_TMP_1~1_1 |v_main_#t~nondet8_2|)) InVars {main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__x~0=v_main_~main__x~0_18} OutVars{main_~main__x~0=v_main_~main__x~0_18, main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~1, main_#t~nondet8] {715#true} is VALID [2022-04-15 00:50:37,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {715#true} [92] L128-->L134: Formula: (and (= (+ v_main_~main__x~0_20 4) v_main_~main__x~0_19) (= v_main_~main__y~0_10 1) (= v_main_~main____CPAchecker_TMP_1~1_3 v_~__tmp_88_1~0_3) (= v_~__tmp_88_0~0_3 v_main_~main____CPAchecker_TMP_0~0_10) (not (= v_main_~main____CPAchecker_TMP_1~1_3 0))) InVars {main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_10, main_~main__x~0=v_main_~main__x~0_20} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_3, main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_10, ~__tmp_88_1~0=v_~__tmp_88_1~0_3, main_~main__x~0=v_main_~main__x~0_19, main_~main__y~0=v_main_~main__y~0_10} AuxVars[] AssignedVars[~__tmp_88_0~0, ~__tmp_88_1~0, main_~main__x~0, main_~main__y~0] {715#true} is VALID [2022-04-15 00:50:37,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {715#true} [96] L134-->L83: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 v_~__tmp_88_1~0_2) (= v_main_~main____CPAchecker_TMP_0~1_8 v_~__tmp_88_0~0_2)) InVars {~__tmp_88_1~0=v_~__tmp_88_1~0_2, ~__tmp_88_0~0=v_~__tmp_88_0~0_2} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_2, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_8, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, ~__tmp_88_1~0=v_~__tmp_88_1~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_~main____CPAchecker_TMP_1~0] {715#true} is VALID [2022-04-15 00:50:37,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {715#true} [81] L83-->L23: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {715#true} is VALID [2022-04-15 00:50:37,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {715#true} [82] L23-->L25: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {715#true} is VALID [2022-04-15 00:50:37,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {715#true} [85] L25-->L117: Formula: (not (= (mod (mod (mod v_main_~main__x~0_15 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_15} OutVars{main_~main__x~0=v_main_~main__x~0_15} AuxVars[] AssignedVars[] {715#true} is VALID [2022-04-15 00:50:39,450 WARN L290 TraceCheckUtils]: 15: Hoare triple {715#true} [88] L117-->L122: Formula: (and (= 0 v_main_~main__y~0_9) (= (mod (mod (mod v_main_~main__x~0_17 4294967296) 3) 4294967296) 2) (= v_main_~main____CPAchecker_TMP_0~0_9 v_~__tmp_93_0~0_3) (= (+ v_main_~main__x~0_17 1) v_main_~main__x~0_16)) InVars {main_~main__x~0=v_main_~main__x~0_17, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_9} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_9, main_~main__x~0=v_main_~main__x~0_16, ~__tmp_93_0~0=v_~__tmp_93_0~0_3, main_~main__y~0=v_main_~main__y~0_9} AuxVars[] AssignedVars[~__tmp_93_0~0, main_~main__x~0, main_~main__y~0] {720#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-15 00:50:39,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {720#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [91] L122-->L56: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_6 v_~__tmp_93_0~0_2) (= v_main_~main____CPAchecker_TMP_0~1_6 v_~__tmp_94_0~0_3)) InVars {~__tmp_93_0~0=v_~__tmp_93_0~0_2} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_3, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_6, ~__tmp_93_0~0=v_~__tmp_93_0~0_2} AuxVars[] AssignedVars[~__tmp_94_0~0, main_~main____CPAchecker_TMP_0~1] {720#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 00:50:39,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {720#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [90] L56-->L37: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet6_2|) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_94_0~0_2) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~1, main_~main____CPAchecker_TMP_0~0] {720#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 00:50:39,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {720#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [95] L37-->L90: Formula: (= v_main_~main____CPAchecker_TMP_0~1_11 0) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} AuxVars[] AssignedVars[] {720#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 00:50:39,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {720#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [100] L90-->L97: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (mod v_main_~main__y~0_7 4294967296) 0) (= (ite (= (mod (mod (mod v_main_~main__x~0_14 4294967296) 3) 4294967296) 0) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {721#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-15 00:50:39,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {721#(not (= main_~__VERIFIER_assert__cond~0 0))} [104] L97-->L99: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {716#false} is VALID [2022-04-15 00:50:39,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {716#false} [108] L99-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#false} is VALID [2022-04-15 00:50:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 00:50:39,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:50:39,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775447552] [2022-04-15 00:50:39,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775447552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:50:39,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:50:39,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 00:50:39,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536502679] [2022-04-15 00:50:39,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:50:39,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 00:50:39,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:50:39,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:50:41,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 00:50:41,690 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 00:50:41,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:50:41,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 00:50:41,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 00:50:41,691 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:50:45,892 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:50:48,065 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:50:50,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:50:56,796 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:51:01,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:51:03,377 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:51:03,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:51:03,655 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-04-15 00:51:03,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 00:51:03,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 00:51:03,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:51:03,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:51:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 00:51:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:51:03,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 00:51:03,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-15 00:51:08,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 65 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 00:51:08,077 INFO L225 Difference]: With dead ends: 60 [2022-04-15 00:51:08,077 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 00:51:08,077 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:51:08,078 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-04-15 00:51:08,078 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 57 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 6 Unknown, 0 Unchecked, 12.7s Time] [2022-04-15 00:51:08,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 00:51:08,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 00:51:08,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:51:08,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-04-15 00:51:08,079 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-04-15 00:51:08,079 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-04-15 00:51:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:51:08,079 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:51:08,079 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:51:08,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:51:08,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:51:08,079 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-04-15 00:51:08,079 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-04-15 00:51:08,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:51:08,080 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:51:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:51:08,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:51:08,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:51:08,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:51:08,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:51:08,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-04-15 00:51:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 00:51:08,081 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-15 00:51:08,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:51:08,081 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 00:51:08,081 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:51:08,081 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:51:08,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:51:08,084 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:51:08,084 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 00:51:08,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 00:51:08,157 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 00:51:08,158 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:51:08,158 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:51:08,158 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 00:51:08,158 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 00:51:08,158 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:51:08,158 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:51:08,158 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 16 151) the Hoare annotation is: (and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|)) [2022-04-15 00:51:08,158 INFO L885 garLoopResultBuilder]: At program point L83(lines 17 151) the Hoare annotation is: true [2022-04-15 00:51:08,158 INFO L882 garLoopResultBuilder]: For program point L23(lines 23 150) no Hoare annotation was computed. [2022-04-15 00:51:08,158 INFO L882 garLoopResultBuilder]: For program point L25(lines 25 145) no Hoare annotation was computed. [2022-04-15 00:51:08,158 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 16 151) no Hoare annotation was computed. [2022-04-15 00:51:08,158 INFO L878 garLoopResultBuilder]: At program point L44(lines 26 114) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-15 00:51:08,159 INFO L882 garLoopResultBuilder]: For program point L117(lines 117 144) no Hoare annotation was computed. [2022-04-15 00:51:08,159 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 16 151) no Hoare annotation was computed. [2022-04-15 00:51:08,159 INFO L878 garLoopResultBuilder]: At program point L56(lines 26 114) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-15 00:51:08,159 INFO L878 garLoopResultBuilder]: At program point L122(lines 25 145) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-15 00:51:08,159 INFO L882 garLoopResultBuilder]: For program point L128(lines 128 143) no Hoare annotation was computed. [2022-04-15 00:51:08,159 INFO L882 garLoopResultBuilder]: For program point L37(lines 37 113) no Hoare annotation was computed. [2022-04-15 00:51:08,159 INFO L885 garLoopResultBuilder]: At program point L134(lines 25 145) the Hoare annotation is: true [2022-04-15 00:51:08,159 INFO L885 garLoopResultBuilder]: At program point L142(lines 25 145) the Hoare annotation is: true [2022-04-15 00:51:08,159 INFO L882 garLoopResultBuilder]: For program point L39(lines 39 86) no Hoare annotation was computed. [2022-04-15 00:51:08,159 INFO L882 garLoopResultBuilder]: For program point L90(lines 90 112) no Hoare annotation was computed. [2022-04-15 00:51:08,159 INFO L882 garLoopResultBuilder]: For program point L48(lines 48 85) no Hoare annotation was computed. [2022-04-15 00:51:08,159 INFO L882 garLoopResultBuilder]: For program point L97(lines 97 106) no Hoare annotation was computed. [2022-04-15 00:51:08,159 INFO L882 garLoopResultBuilder]: For program point L62(lines 62 84) no Hoare annotation was computed. [2022-04-15 00:51:08,159 INFO L882 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2022-04-15 00:51:08,160 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 99) no Hoare annotation was computed. [2022-04-15 00:51:08,162 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-15 00:51:08,163 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:51:08,168 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:51:08,170 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:51:08,170 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 00:51:08,173 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:51:08,173 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 00:51:08,173 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 00:51:08,174 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 00:51:08,174 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 00:51:08,174 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:51:08,179 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-15 00:51:08,179 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-15 00:51:08,179 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:51:08,179 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 00:51:08,179 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-04-15 00:51:08,180 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-04-15 00:51:08,180 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:51:08,180 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 00:51:08,180 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 00:51:08,180 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-15 00:51:08,180 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-15 00:51:08,180 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-04-15 00:51:08,180 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-04-15 00:51:08,180 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 00:51:08,180 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 00:51:08,180 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-04-15 00:51:08,180 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-04-15 00:51:08,180 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-04-15 00:51:08,180 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-04-15 00:51:08,180 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-15 00:51:08,180 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-15 00:51:08,180 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:51:08,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:51:08 BasicIcfg [2022-04-15 00:51:08,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:51:08,190 INFO L158 Benchmark]: Toolchain (without parser) took 224008.27ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 131.6MB in the beginning and 159.2MB in the end (delta: -27.6MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2022-04-15 00:51:08,190 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory was 147.9MB in the beginning and 147.8MB in the end (delta: 88.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:51:08,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.98ms. Allocated memory is still 181.4MB. Free memory was 131.4MB in the beginning and 159.8MB in the end (delta: -28.4MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-04-15 00:51:08,190 INFO L158 Benchmark]: Boogie Preprocessor took 19.07ms. Allocated memory is still 181.4MB. Free memory was 159.8MB in the beginning and 158.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:51:08,190 INFO L158 Benchmark]: RCFGBuilder took 9096.78ms. Allocated memory is still 181.4MB. Free memory was 158.2MB in the beginning and 144.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 00:51:08,191 INFO L158 Benchmark]: IcfgTransformer took 25.89ms. Allocated memory is still 181.4MB. Free memory was 144.5MB in the beginning and 142.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:51:08,191 INFO L158 Benchmark]: TraceAbstraction took 214647.28ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 142.0MB in the beginning and 159.2MB in the end (delta: -17.2MB). Peak memory consumption was 20.4MB. Max. memory is 8.0GB. [2022-04-15 00:51:08,192 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory was 147.9MB in the beginning and 147.8MB in the end (delta: 88.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 201.98ms. Allocated memory is still 181.4MB. Free memory was 131.4MB in the beginning and 159.8MB in the end (delta: -28.4MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.07ms. Allocated memory is still 181.4MB. Free memory was 159.8MB in the beginning and 158.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 9096.78ms. Allocated memory is still 181.4MB. Free memory was 158.2MB in the beginning and 144.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 25.89ms. Allocated memory is still 181.4MB. Free memory was 144.5MB in the beginning and 142.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 214647.28ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 142.0MB in the beginning and 159.2MB in the end (delta: -17.2MB). Peak memory consumption was 20.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 99]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 214.6s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 195.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 54 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 114.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 287 SdHoareTripleChecker+Invalid, 108.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 183 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 258 IncrementalHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 104 mSDtfsCounter, 258 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 20 NumberOfFragments, 187 HoareAnnotationTreeSize, 10 FomulaSimplifications, 704 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 1175 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 7/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 00:51:08,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...