/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-acceleration/multivar_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 22:14:55,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 22:14:55,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 22:14:55,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 22:14:55,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 22:14:55,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 22:14:55,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 22:14:55,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 22:14:55,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 22:14:55,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 22:14:55,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 22:14:55,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 22:14:55,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 22:14:55,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 22:14:55,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 22:14:55,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 22:14:55,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 22:14:55,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 22:14:55,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 22:14:55,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 22:14:55,218 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 22:14:55,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 22:14:55,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 22:14:55,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 22:14:55,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 22:14:55,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 22:14:55,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 22:14:55,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 22:14:55,227 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 22:14:55,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 22:14:55,228 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 22:14:55,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 22:14:55,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 22:14:55,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 22:14:55,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 22:14:55,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 22:14:55,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 22:14:55,231 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 22:14:55,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 22:14:55,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 22:14:55,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 22:14:55,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 22:14:55,233 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 22:14:55,248 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 22:14:55,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 22:14:55,249 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 22:14:55,249 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 22:14:55,250 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 22:14:55,250 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 22:14:55,250 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 22:14:55,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 22:14:55,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 22:14:55,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 22:14:55,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 22:14:55,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 22:14:55,251 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 22:14:55,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 22:14:55,251 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 22:14:55,251 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 22:14:55,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 22:14:55,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 22:14:55,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 22:14:55,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:14:55,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 22:14:55,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 22:14:55,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 22:14:55,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 22:14:55,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 22:14:55,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 22:14:55,252 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 22:14:55,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 22:14:55,253 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 22:14:55,253 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-07 22:14:55,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 22:14:55,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 22:14:55,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 22:14:55,461 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 22:14:55,464 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 22:14:55,465 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/multivar_1-1.c [2022-04-07 22:14:55,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04506f6b1/e501f6a6f48b41c684f04dc7589aead6/FLAG82de97476 [2022-04-07 22:14:55,888 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 22:14:55,888 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/multivar_1-1.c [2022-04-07 22:14:55,892 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04506f6b1/e501f6a6f48b41c684f04dc7589aead6/FLAG82de97476 [2022-04-07 22:14:55,906 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04506f6b1/e501f6a6f48b41c684f04dc7589aead6 [2022-04-07 22:14:55,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 22:14:55,909 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 22:14:55,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 22:14:55,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 22:14:55,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 22:14:55,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:14:55" (1/1) ... [2022-04-07 22:14:55,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13828ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:55, skipping insertion in model container [2022-04-07 22:14:55,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:14:55" (1/1) ... [2022-04-07 22:14:55,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 22:14:55,935 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 22:14:56,050 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-acceleration/multivar_1-1.c[374,387] [2022-04-07 22:14:56,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:14:56,071 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 22:14:56,079 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-acceleration/multivar_1-1.c[374,387] [2022-04-07 22:14:56,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:14:56,099 INFO L208 MainTranslator]: Completed translation [2022-04-07 22:14:56,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:56 WrapperNode [2022-04-07 22:14:56,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 22:14:56,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 22:14:56,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 22:14:56,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 22:14:56,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:56" (1/1) ... [2022-04-07 22:14:56,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:56" (1/1) ... [2022-04-07 22:14:56,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:56" (1/1) ... [2022-04-07 22:14:56,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:56" (1/1) ... [2022-04-07 22:14:56,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:56" (1/1) ... [2022-04-07 22:14:56,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:56" (1/1) ... [2022-04-07 22:14:56,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:56" (1/1) ... [2022-04-07 22:14:56,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 22:14:56,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 22:14:56,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 22:14:56,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 22:14:56,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:56" (1/1) ... [2022-04-07 22:14:56,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:14:56,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:14:56,160 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-07 22:14:56,179 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-07 22:14:56,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 22:14:56,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 22:14:56,198 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 22:14:56,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 22:14:56,198 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 22:14:56,198 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 22:14:56,198 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 22:14:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 22:14:56,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 22:14:56,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 22:14:56,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 22:14:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 22:14:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 22:14:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 22:14:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 22:14:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 22:14:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 22:14:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 22:14:56,249 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 22:14:56,251 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 22:14:56,327 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 22:14:56,332 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 22:14:56,332 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 22:14:56,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:14:56 BoogieIcfgContainer [2022-04-07 22:14:56,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 22:14:56,335 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 22:14:56,335 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 22:14:56,335 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 22:14:56,338 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:14:56" (1/1) ... [2022-04-07 22:14:56,339 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 22:14:56,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:14:56 BasicIcfg [2022-04-07 22:14:56,351 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 22:14:56,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 22:14:56,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 22:14:56,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 22:14:56,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 10:14:55" (1/4) ... [2022-04-07 22:14:56,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7a4013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:14:56, skipping insertion in model container [2022-04-07 22:14:56,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:14:56" (2/4) ... [2022-04-07 22:14:56,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7a4013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:14:56, skipping insertion in model container [2022-04-07 22:14:56,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:14:56" (3/4) ... [2022-04-07 22:14:56,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7a4013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:14:56, skipping insertion in model container [2022-04-07 22:14:56,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:14:56" (4/4) ... [2022-04-07 22:14:56,367 INFO L111 eAbstractionObserver]: Analyzing ICFG multivar_1-1.cqvasr [2022-04-07 22:14:56,371 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 22:14:56,371 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 22:14:56,438 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 22:14:56,443 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-07 22:14:56,448 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 22:14:56,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 22:14:56,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 22:14:56,472 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:14:56,473 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:14:56,473 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:14:56,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:14:56,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1690616289, now seen corresponding path program 1 times [2022-04-07 22:14:56,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:14:56,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370813007] [2022-04-07 22:14:56,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:14:56,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:14:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:56,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:14:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:56,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21#true} is VALID [2022-04-07 22:14:56,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-07 22:14:56,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-07 22:14:56,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:14:56,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21#true} is VALID [2022-04-07 22:14:56,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-07 22:14:56,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-07 22:14:56,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-07 22:14:56,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} [43] mainENTRY-->L17-2: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (= v_main_~x~0_1 v_main_~y~0_1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {21#true} is VALID [2022-04-07 22:14:56,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} [45] L17-2-->L17-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-07 22:14:56,671 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} [48] L17-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~y~0_5 4294967296) (mod v_main_~x~0_6 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {22#false} is VALID [2022-04-07 22:14:56,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} [50] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {22#false} is VALID [2022-04-07 22:14:56,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} [51] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-07 22:14:56,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} [53] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-07 22:14:56,672 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-07 22:14:56,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:14:56,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370813007] [2022-04-07 22:14:56,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370813007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:14:56,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:14:56,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 22:14:56,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536327910] [2022-04-07 22:14:56,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:14:56,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 22:14:56,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:14:56,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:14:56,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:14:56,703 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 22:14:56,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:14:56,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 22:14:56,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 22:14:56,726 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:14:56,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:56,802 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-07 22:14:56,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 22:14:56,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 22:14:56,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:14:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:14:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-07 22:14:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:14:56,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-07 22:14:56,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-07 22:14:56,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:14:56,898 INFO L225 Difference]: With dead ends: 29 [2022-04-07 22:14:56,899 INFO L226 Difference]: Without dead ends: 12 [2022-04-07 22:14:56,900 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 22:14:56,903 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:14:56,904 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:14:56,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-07 22:14:56,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-07 22:14:56,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:14:56,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:14:56,926 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:14:56,926 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:14:56,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:56,928 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-07 22:14:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-07 22:14:56,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:14:56,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:14:56,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-07 22:14:56,929 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-07 22:14:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:56,930 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-07 22:14:56,930 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-07 22:14:56,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:14:56,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:14:56,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:14:56,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:14:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:14:56,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-07 22:14:56,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-07 22:14:56,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:14:56,933 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-07 22:14:56,934 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:14:56,934 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-07 22:14:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 22:14:56,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:14:56,934 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:14:56,935 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 22:14:56,935 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:14:56,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:14:56,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1689692768, now seen corresponding path program 1 times [2022-04-07 22:14:56,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:14:56,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668756608] [2022-04-07 22:14:56,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:14:56,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:14:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:57,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:14:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:14:57,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {110#true} is VALID [2022-04-07 22:14:57,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-07 22:14:57,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110#true} {110#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-07 22:14:57,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {110#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:14:57,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= (select |v_#length_1| 2) 15) (= 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {110#true} is VALID [2022-04-07 22:14:57,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {110#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-07 22:14:57,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110#true} {110#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-07 22:14:57,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {110#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-07 22:14:57,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#true} [43] mainENTRY-->L17-2: Formula: (and (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (= v_main_~x~0_1 v_main_~y~0_1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {115#(= (+ main_~x~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-07 22:14:57,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {115#(= (+ main_~x~0 (* (- 1) main_~y~0)) 0)} [46] L17-2-->L17-3: Formula: (not (< (mod v_main_~x~0_2 4294967296) 1024)) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {115#(= (+ main_~x~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-07 22:14:57,157 INFO L272 TraceCheckUtils]: 7: Hoare triple {115#(= (+ main_~x~0 (* (- 1) main_~y~0)) 0)} [48] L17-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~y~0_5 4294967296) (mod v_main_~x~0_6 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {116#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 22:14:57,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {116#(not (= |__VERIFIER_assert_#in~cond| 0))} [50] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {117#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 22:14:57,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {117#(not (= __VERIFIER_assert_~cond 0))} [51] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {111#false} is VALID [2022-04-07 22:14:57,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {111#false} [53] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#false} is VALID [2022-04-07 22:14:57,158 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-07 22:14:57,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:14:57,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668756608] [2022-04-07 22:14:57,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668756608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:14:57,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:14:57,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 22:14:57,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39560497] [2022-04-07 22:14:57,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:14:57,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 22:14:57,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:14:57,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:14:57,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:14:57,170 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 22:14:57,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:14:57,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 22:14:57,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 22:14:57,172 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:14:57,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:57,244 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-07 22:14:57,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 22:14:57,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 22:14:57,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:14:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:14:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2022-04-07 22:14:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:14:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2022-04-07 22:14:57,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 12 transitions. [2022-04-07 22:14:57,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:14:57,257 INFO L225 Difference]: With dead ends: 12 [2022-04-07 22:14:57,257 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 22:14:57,258 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-07 22:14:57,259 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 22:14:57,259 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 24 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 22:14:57,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 22:14:57,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 22:14:57,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:14:57,276 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-07 22:14:57,276 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-07 22:14:57,276 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-07 22:14:57,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:57,276 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:14:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:14:57,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:14:57,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:14:57,277 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-07 22:14:57,277 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-07 22:14:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:14:57,277 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:14:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:14:57,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:14:57,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:14:57,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:14:57,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:14:57,278 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-07 22:14:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 22:14:57,278 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2022-04-07 22:14:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:14:57,278 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 22:14:57,278 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:14:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:14:57,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:14:57,281 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 22:14:57,281 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 22:14:57,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 22:14:57,301 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 22:14:57,301 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:14:57,301 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:14:57,301 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 22:14:57,301 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 22:14:57,301 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:14:57,302 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:14:57,302 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 13 23) the Hoare annotation is: true [2022-04-07 22:14:57,302 INFO L878 garLoopResultBuilder]: At program point L17-2(lines 17 20) the Hoare annotation is: (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) [2022-04-07 22:14:57,302 INFO L878 garLoopResultBuilder]: At program point L17-3(lines 17 20) the Hoare annotation is: (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) [2022-04-07 22:14:57,302 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 13 23) no Hoare annotation was computed. [2022-04-07 22:14:57,302 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 13 23) no Hoare annotation was computed. [2022-04-07 22:14:57,302 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2022-04-07 22:14:57,302 INFO L882 garLoopResultBuilder]: For program point L7(lines 7 9) no Hoare annotation was computed. [2022-04-07 22:14:57,302 INFO L882 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-07 22:14:57,302 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2022-04-07 22:14:57,303 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2022-04-07 22:14:57,303 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2022-04-07 22:14:57,305 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-07 22:14:57,306 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 22:14:57,310 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:14:57,311 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 22:14:57,311 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:14:57,312 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 22:14:57,312 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-07 22:14:57,312 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 22:14:57,313 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-07 22:14:57,313 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-07 22:14:57,313 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-07 22:14:57,313 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:14:57,331 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 22:14:57,331 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 22:14:57,331 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 22:14:57,331 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-07 22:14:57,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:14:57 BasicIcfg [2022-04-07 22:14:57,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 22:14:57,339 INFO L158 Benchmark]: Toolchain (without parser) took 1430.36ms. Allocated memory was 201.3MB in the beginning and 242.2MB in the end (delta: 40.9MB). Free memory was 148.7MB in the beginning and 219.7MB in the end (delta: -71.0MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2022-04-07 22:14:57,340 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory was 164.8MB in the beginning and 164.6MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 22:14:57,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.49ms. Allocated memory is still 201.3MB. Free memory was 148.4MB in the beginning and 177.5MB in the end (delta: -29.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 22:14:57,340 INFO L158 Benchmark]: Boogie Preprocessor took 28.99ms. Allocated memory is still 201.3MB. Free memory was 177.5MB in the beginning and 176.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 22:14:57,341 INFO L158 Benchmark]: RCFGBuilder took 204.20ms. Allocated memory is still 201.3MB. Free memory was 176.1MB in the beginning and 165.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 22:14:57,341 INFO L158 Benchmark]: IcfgTransformer took 16.49ms. Allocated memory is still 201.3MB. Free memory was 165.6MB in the beginning and 164.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 22:14:57,341 INFO L158 Benchmark]: TraceAbstraction took 986.38ms. Allocated memory was 201.3MB in the beginning and 242.2MB in the end (delta: 40.9MB). Free memory was 164.0MB in the beginning and 219.7MB in the end (delta: -55.8MB). Peak memory consumption was 54.8MB. Max. memory is 8.0GB. [2022-04-07 22:14:57,343 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.13ms. Allocated memory is still 201.3MB. Free memory was 164.8MB in the beginning and 164.6MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.49ms. Allocated memory is still 201.3MB. Free memory was 148.4MB in the beginning and 177.5MB in the end (delta: -29.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.99ms. Allocated memory is still 201.3MB. Free memory was 177.5MB in the beginning and 176.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 204.20ms. Allocated memory is still 201.3MB. Free memory was 176.1MB in the beginning and 165.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 16.49ms. Allocated memory is still 201.3MB. Free memory was 165.6MB in the beginning and 164.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 986.38ms. Allocated memory was 201.3MB in the beginning and 242.2MB in the end (delta: 40.9MB). Free memory was 164.0MB in the beginning and 219.7MB in the end (delta: -55.8MB). Peak memory consumption was 54.8MB. 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: 8]: 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 4 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 24 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 8 PreInvPairs, 9 NumberOfFragments, 25 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 50 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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: 17]: Loop Invariant Derived loop invariant: x + -1 * y == 0 RESULT: Ultimate proved your program to be correct! [2022-04-07 22:14:57,374 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...