/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops/sum03-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 16:43:17,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 16:43:17,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 16:43:17,078 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 16:43:17,078 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 16:43:17,079 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 16:43:17,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 16:43:17,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 16:43:17,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 16:43:17,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 16:43:17,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 16:43:17,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 16:43:17,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 16:43:17,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 16:43:17,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 16:43:17,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 16:43:17,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 16:43:17,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 16:43:17,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 16:43:17,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 16:43:17,091 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 16:43:17,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 16:43:17,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 16:43:17,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 16:43:17,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 16:43:17,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 16:43:17,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 16:43:17,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 16:43:17,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 16:43:17,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 16:43:17,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 16:43:17,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 16:43:17,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 16:43:17,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 16:43:17,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 16:43:17,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 16:43:17,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 16:43:17,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 16:43:17,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 16:43:17,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 16:43:17,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 16:43:17,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 16:43:17,105 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 16:43:17,110 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 16:43:17,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 16:43:17,111 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 16:43:17,111 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 16:43:17,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 16:43:17,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 16:43:17,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 16:43:17,112 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 16:43:17,112 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 16:43:17,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 16:43:17,112 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 16:43:17,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 16:43:17,112 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 16:43:17,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 16:43:17,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 16:43:17,113 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 16:43:17,113 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 16:43:17,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 16:43:17,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:43:17,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 16:43:17,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 16:43:17,114 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 16:43:17,114 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 16:43:17,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 16:43:17,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 16:43:17,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 16:43:17,295 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 16:43:17,299 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 16:43:17,300 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum03-2.i [2022-04-07 16:43:17,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b5b8ff2/b4ac502a1257463a90303f46a74ba42a/FLAGe6f17d5ff [2022-04-07 16:43:17,643 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 16:43:17,643 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-2.i [2022-04-07 16:43:17,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b5b8ff2/b4ac502a1257463a90303f46a74ba42a/FLAGe6f17d5ff [2022-04-07 16:43:18,080 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59b5b8ff2/b4ac502a1257463a90303f46a74ba42a [2022-04-07 16:43:18,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 16:43:18,082 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 16:43:18,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 16:43:18,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 16:43:18,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 16:43:18,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:43:18" (1/1) ... [2022-04-07 16:43:18,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bab04bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:18, skipping insertion in model container [2022-04-07 16:43:18,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:43:18" (1/1) ... [2022-04-07 16:43:18,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 16:43:18,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 16:43:18,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-2.i[807,820] [2022-04-07 16:43:18,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:43:18,239 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 16:43:18,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-2.i[807,820] [2022-04-07 16:43:18,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:43:18,257 INFO L208 MainTranslator]: Completed translation [2022-04-07 16:43:18,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:18 WrapperNode [2022-04-07 16:43:18,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 16:43:18,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 16:43:18,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 16:43:18,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 16:43:18,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:18" (1/1) ... [2022-04-07 16:43:18,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:18" (1/1) ... [2022-04-07 16:43:18,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:18" (1/1) ... [2022-04-07 16:43:18,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:18" (1/1) ... [2022-04-07 16:43:18,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:18" (1/1) ... [2022-04-07 16:43:18,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:18" (1/1) ... [2022-04-07 16:43:18,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:18" (1/1) ... [2022-04-07 16:43:18,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 16:43:18,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 16:43:18,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 16:43:18,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 16:43:18,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:18" (1/1) ... [2022-04-07 16:43:18,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:43:18,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:43:18,298 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 16:43:18,307 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 16:43:18,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 16:43:18,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 16:43:18,324 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 16:43:18,324 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 16:43:18,324 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 16:43:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 16:43:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 16:43:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 16:43:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 16:43:18,324 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 16:43:18,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 16:43:18,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 16:43:18,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 16:43:18,326 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 16:43:18,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 16:43:18,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 16:43:18,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 16:43:18,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 16:43:18,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 16:43:18,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 16:43:18,377 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 16:43:18,378 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 16:43:18,462 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 16:43:18,466 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 16:43:18,467 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 16:43:18,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:43:18 BoogieIcfgContainer [2022-04-07 16:43:18,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 16:43:18,468 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 16:43:18,469 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 16:43:18,475 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 16:43:18,477 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:43:18" (1/1) ... [2022-04-07 16:43:18,479 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 16:43:18,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:43:18 BasicIcfg [2022-04-07 16:43:18,488 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 16:43:18,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 16:43:18,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 16:43:18,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 16:43:18,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 04:43:18" (1/4) ... [2022-04-07 16:43:18,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509e4418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:43:18, skipping insertion in model container [2022-04-07 16:43:18,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:18" (2/4) ... [2022-04-07 16:43:18,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509e4418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:43:18, skipping insertion in model container [2022-04-07 16:43:18,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:43:18" (3/4) ... [2022-04-07 16:43:18,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509e4418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:43:18, skipping insertion in model container [2022-04-07 16:43:18,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:43:18" (4/4) ... [2022-04-07 16:43:18,494 INFO L111 eAbstractionObserver]: Analyzing ICFG sum03-2.iJordan [2022-04-07 16:43:18,497 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 16:43:18,497 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 16:43:18,524 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 16:43:18,528 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 16:43:18,529 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 16:43:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 12 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 16:43:18,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 16:43:18,544 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:43:18,545 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:43:18,545 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:43:18,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:43:18,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1196085861, now seen corresponding path program 1 times [2022-04-07 16:43:18,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:43:18,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170170083] [2022-04-07 16:43:18,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:43:18,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:43:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:18,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:43:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:18,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [46] 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) (= (select |v_#length_1| 2) 10) (= (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 16:43:18,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} [49] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-07 16:43:18,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} [61] 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 16:43:19,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} [44] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:43:19,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [46] 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) (= (select |v_#length_1| 2) 10) (= (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 16:43:19,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} [49] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-07 16:43:19,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} [61] 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 16:43:19,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} [45] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-07 16:43:19,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} [48] mainENTRY-->L27-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_4 0) (= v_main_~sn~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_4, main_~sn~0=v_main_~sn~0_4, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {26#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-07 16:43:19,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#(and (= main_~sn~0 0) (= main_~x~0 0))} [52] L27-1-->L27: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~x~0, main_~sn~0, main_#t~post3] {27#(and (<= (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)))) (not (<= (+ (div main_~sn~0 4294967296) 1) 0)) (< (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296) 1)) (<= (div (* main_~x~0 2) 4294967296) 0))} is VALID [2022-04-07 16:43:19,011 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#(and (<= (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)))) (not (<= (+ (div main_~sn~0 4294967296) 1) 0)) (< (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296) 1)) (<= (div (* main_~x~0 2) 4294967296) 0))} [54] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {28#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 16:43:19,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#(not (= |__VERIFIER_assert_#in~cond| 0))} [55] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {29#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 16:43:19,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#(not (= __VERIFIER_assert_~cond 0))} [56] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-07 16:43:19,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} [58] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-07 16:43:19,016 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 16:43:19,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:43:19,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170170083] [2022-04-07 16:43:19,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170170083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:43:19,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:43:19,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 16:43:19,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507956061] [2022-04-07 16:43:19,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:43:19,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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 16:43:19,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:43:19,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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 16:43:19,040 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 16:43:19,040 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 16:43:19,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:43:19,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 16:43:19,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-07 16:43:19,065 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 12 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 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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 16:43:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:19,326 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-07 16:43:19,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 16:43:19,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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 16:43:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:43:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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 16:43:19,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2022-04-07 16:43:19,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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 16:43:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2022-04-07 16:43:19,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2022-04-07 16:43:19,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:43:19,377 INFO L225 Difference]: With dead ends: 21 [2022-04-07 16:43:19,377 INFO L226 Difference]: Without dead ends: 21 [2022-04-07 16:43:19,378 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-07 16:43:19,382 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 16:43:19,383 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 16:43:19,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-07 16:43:19,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-07 16:43:19,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:43:19,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:43:19,403 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:43:19,403 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:43:19,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:19,405 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-07 16:43:19,406 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-07 16:43:19,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:19,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:19,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-04-07 16:43:19,407 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-04-07 16:43:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:19,410 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-07 16:43:19,410 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-07 16:43:19,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:19,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:19,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:43:19,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:43:19,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:43:19,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-07 16:43:19,414 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 11 [2022-04-07 16:43:19,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:43:19,415 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-07 16:43:19,415 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 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 16:43:19,415 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-07 16:43:19,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 16:43:19,417 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:43:19,417 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:43:19,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 16:43:19,419 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:43:19,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:43:19,424 INFO L85 PathProgramCache]: Analyzing trace with hash 593480926, now seen corresponding path program 1 times [2022-04-07 16:43:19,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:43:19,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248862399] [2022-04-07 16:43:19,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:43:19,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:43:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:19,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:43:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:19,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {140#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [46] 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) (= (select |v_#length_1| 2) 10) (= (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] {126#true} is VALID [2022-04-07 16:43:19,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#true} [49] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:19,646 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {126#true} {126#true} [61] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:19,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-07 16:43:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:19,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {126#true} [55] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {126#true} is VALID [2022-04-07 16:43:19,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#true} [57] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:19,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {126#true} [60] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:19,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126#true} {132#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} [63] __VERIFIER_assertEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {132#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} is VALID [2022-04-07 16:43:19,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {126#true} [44] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {140#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:43:19,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [46] 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) (= (select |v_#length_1| 2) 10) (= (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] {126#true} is VALID [2022-04-07 16:43:19,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {126#true} [49] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:19,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126#true} {126#true} [61] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:19,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {126#true} [45] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:19,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {126#true} [48] mainENTRY-->L27-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_4 0) (= v_main_~sn~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_4, main_~sn~0=v_main_~sn~0_4, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {131#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-07 16:43:19,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {131#(and (= main_~sn~0 0) (= main_~x~0 0))} [52] L27-1-->L27: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~x~0, main_~sn~0, main_#t~post3] {132#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} is VALID [2022-04-07 16:43:19,661 INFO L272 TraceCheckUtils]: 7: Hoare triple {132#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} [54] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {126#true} is VALID [2022-04-07 16:43:19,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {126#true} [55] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {126#true} is VALID [2022-04-07 16:43:19,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {126#true} [57] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:19,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {126#true} [60] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:19,662 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {126#true} {132#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} [63] __VERIFIER_assertEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {132#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} is VALID [2022-04-07 16:43:19,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {132#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} [52] L27-1-->L27: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~x~0, main_~sn~0, main_#t~post3] {137#(and (<= (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)))) (not (<= (+ (div main_~sn~0 4294967296) 1) 0)) (< (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296) 1)) (<= (div (* main_~x~0 2) 4294967296) 0))} is VALID [2022-04-07 16:43:19,664 INFO L272 TraceCheckUtils]: 13: Hoare triple {137#(and (<= (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)))) (not (<= (+ (div main_~sn~0 4294967296) 1) 0)) (< (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296) 1)) (<= (div (* main_~x~0 2) 4294967296) 0))} [54] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {138#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 16:43:19,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {138#(not (= |__VERIFIER_assert_#in~cond| 0))} [55] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {139#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 16:43:19,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {139#(not (= __VERIFIER_assert_~cond 0))} [56] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {127#false} is VALID [2022-04-07 16:43:19,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {127#false} [58] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {127#false} is VALID [2022-04-07 16:43:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:19,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:43:19,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248862399] [2022-04-07 16:43:19,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248862399] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:43:19,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236101573] [2022-04-07 16:43:19,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:43:19,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:43:19,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:43:19,678 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 16:43:19,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 16:43:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:19,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 16:43:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:19,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:43:20,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {126#true} [44] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:20,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#true} [46] 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) (= (select |v_#length_1| 2) 10) (= (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] {126#true} is VALID [2022-04-07 16:43:20,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {126#true} [49] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:20,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126#true} {126#true} [61] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:20,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {126#true} [45] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:20,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {126#true} [48] mainENTRY-->L27-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_4 0) (= v_main_~sn~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_4, main_~sn~0=v_main_~sn~0_4, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {131#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-07 16:43:20,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {131#(and (= main_~sn~0 0) (= main_~x~0 0))} [52] L27-1-->L27: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~x~0, main_~sn~0, main_#t~post3] {132#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} is VALID [2022-04-07 16:43:20,193 INFO L272 TraceCheckUtils]: 7: Hoare triple {132#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} [54] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {126#true} is VALID [2022-04-07 16:43:20,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {126#true} [55] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {126#true} is VALID [2022-04-07 16:43:20,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {126#true} [57] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:20,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {126#true} [60] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:20,194 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {126#true} {132#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} [63] __VERIFIER_assertEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {132#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} is VALID [2022-04-07 16:43:20,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {132#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} [52] L27-1-->L27: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~x~0, main_~sn~0, main_#t~post3] {180#(and (<= 4 main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)) (<= main_~x~0 2))} is VALID [2022-04-07 16:43:20,196 INFO L272 TraceCheckUtils]: 13: Hoare triple {180#(and (<= 4 main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)) (<= main_~x~0 2))} [54] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {184#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:43:20,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {184#(<= 1 |__VERIFIER_assert_#in~cond|)} [55] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {188#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:43:20,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {188#(<= 1 __VERIFIER_assert_~cond)} [56] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {127#false} is VALID [2022-04-07 16:43:20,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {127#false} [58] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {127#false} is VALID [2022-04-07 16:43:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:20,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:43:20,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {127#false} [58] L15-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {127#false} is VALID [2022-04-07 16:43:20,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {188#(<= 1 __VERIFIER_assert_~cond)} [56] L14-->L15: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {127#false} is VALID [2022-04-07 16:43:20,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {184#(<= 1 |__VERIFIER_assert_#in~cond|)} [55] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {188#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:43:20,428 INFO L272 TraceCheckUtils]: 13: Hoare triple {204#(or (= (mod main_~sn~0 4294967296) 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))} [54] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {184#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:43:20,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {208#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} [52] L27-1-->L27: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~x~0, main_~sn~0, main_#t~post3] {204#(or (= (mod main_~sn~0 4294967296) 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))} is VALID [2022-04-07 16:43:20,432 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {126#true} {208#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} [63] __VERIFIER_assertEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {208#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} is VALID [2022-04-07 16:43:20,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {126#true} [60] L14-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:20,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {126#true} [57] L14-->L14-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:20,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {126#true} [55] __VERIFIER_assertENTRY-->L14: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {126#true} is VALID [2022-04-07 16:43:20,432 INFO L272 TraceCheckUtils]: 7: Hoare triple {208#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} [54] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~sn~0_5 4294967296))) (or (= .cse0 0) (= .cse0 (mod (* v_main_~x~0_5 2) 4294967296)))) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~x~0=v_main_~x~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~x~0] {126#true} is VALID [2022-04-07 16:43:20,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {227#(or (= (mod (+ main_~sn~0 4) 4294967296) 0) (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)))} [52] L27-1-->L27: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~sn~0=v_main_~sn~0_2} OutVars{main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_1, main_~sn~0=v_main_~sn~0_1} AuxVars[] AssignedVars[main_~x~0, main_~sn~0, main_#t~post3] {208#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} is VALID [2022-04-07 16:43:20,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {126#true} [48] mainENTRY-->L27-1: Formula: (and (= v_main_~n1~0_1 |v_main_#t~nondet2_2|) (= v_main_~loop1~0_1 |v_main_#t~nondet1_2|) (= v_main_~x~0_4 0) (= v_main_~sn~0_4 0)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~n1~0=v_main_~n1~0_1, main_~x~0=v_main_~x~0_4, main_~sn~0=v_main_~sn~0_4, main_~loop1~0=v_main_~loop1~0_1} AuxVars[] AssignedVars[main_~n1~0, main_~x~0, main_~sn~0, main_#t~nondet1, main_#t~nondet2, main_~loop1~0] {227#(or (= (mod (+ main_~sn~0 4) 4294967296) 0) (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)))} is VALID [2022-04-07 16:43:20,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {126#true} [45] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:20,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126#true} {126#true} [61] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:20,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {126#true} [49] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:20,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#true} [46] 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) (= (select |v_#length_1| 2) 10) (= (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] {126#true} is VALID [2022-04-07 16:43:20,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {126#true} [44] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-04-07 16:43:20,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:20,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236101573] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:43:20,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:43:20,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-07 16:43:20,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627195133] [2022-04-07 16:43:20,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:43:20,473 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 17 [2022-04-07 16:43:20,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:43:20,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:43:20,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:43:20,501 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 16:43:20,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:43:20,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 16:43:20,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-07 16:43:20,502 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:43:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:21,284 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-07 16:43:21,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 16:43:21,284 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 17 [2022-04-07 16:43:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:43:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:43:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2022-04-07 16:43:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:43:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2022-04-07 16:43:21,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 23 transitions. [2022-04-07 16:43:21,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:43:21,339 INFO L225 Difference]: With dead ends: 23 [2022-04-07 16:43:21,339 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 16:43:21,339 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2022-04-07 16:43:21,340 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:43:21,340 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 36 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 16:43:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 16:43:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 16:43:21,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:43:21,341 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 16:43:21,341 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 16:43:21,341 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 16:43:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:21,341 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 16:43:21,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 16:43:21,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:21,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:21,341 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 16:43:21,341 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 16:43:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:21,341 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 16:43:21,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 16:43:21,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:21,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:21,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:43:21,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:43:21,342 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 16:43:21,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 16:43:21,342 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-07 16:43:21,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:43:21,342 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 16:43:21,342 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 6 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:43:21,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 16:43:21,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:21,344 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 16:43:21,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 16:43:21,555 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:43:21,558 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-07 16:43:21,559 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 16:43:21,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:43:21 BasicIcfg [2022-04-07 16:43:21,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 16:43:21,561 INFO L158 Benchmark]: Toolchain (without parser) took 3479.20ms. Allocated memory is still 162.5MB. Free memory was 116.1MB in the beginning and 101.9MB in the end (delta: 14.2MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-04-07 16:43:21,562 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 162.5MB. Free memory is still 132.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 16:43:21,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.73ms. Allocated memory is still 162.5MB. Free memory was 115.7MB in the beginning and 141.8MB in the end (delta: -26.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 16:43:21,562 INFO L158 Benchmark]: Boogie Preprocessor took 18.75ms. Allocated memory is still 162.5MB. Free memory was 141.8MB in the beginning and 140.6MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 16:43:21,562 INFO L158 Benchmark]: RCFGBuilder took 190.06ms. Allocated memory is still 162.5MB. Free memory was 140.1MB in the beginning and 130.2MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-07 16:43:21,563 INFO L158 Benchmark]: IcfgTransformer took 19.72ms. Allocated memory is still 162.5MB. Free memory was 130.2MB in the beginning and 129.0MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 16:43:21,563 INFO L158 Benchmark]: TraceAbstraction took 3071.45ms. Allocated memory is still 162.5MB. Free memory was 128.2MB in the beginning and 101.9MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-04-07 16:43:21,564 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.11ms. Allocated memory is still 162.5MB. Free memory is still 132.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 173.73ms. Allocated memory is still 162.5MB. Free memory was 115.7MB in the beginning and 141.8MB in the end (delta: -26.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.75ms. Allocated memory is still 162.5MB. Free memory was 141.8MB in the beginning and 140.6MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 190.06ms. Allocated memory is still 162.5MB. Free memory was 140.1MB in the beginning and 130.2MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 19.72ms. Allocated memory is still 162.5MB. Free memory was 130.2MB in the beginning and 129.0MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3071.45ms. Allocated memory is still 162.5MB. Free memory was 128.2MB in the beginning and 101.9MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. 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: 15]: 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: 3.0s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 19 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=1, InterpolantAutomatonStates: 18, 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 345 SizeOfPredicates, 1 NumberOfNonLiveVariables, 69 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6/12 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 RESULT: Ultimate proved your program to be correct! [2022-04-07 16:43:21,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...