/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:31:36,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:31:36,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:31:36,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:31:36,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:31:36,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:31:36,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:31:36,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:31:36,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:31:36,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:31:36,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:31:36,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:31:36,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:31:36,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:31:36,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:31:36,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:31:36,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:31:36,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:31:36,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:31:36,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:31:36,980 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:31:36,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:31:36,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:31:36,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:31:36,984 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:31:36,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:31:36,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:31:36,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:31:36,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:31:36,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:31:36,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:31:36,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:31:36,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:31:36,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:31:36,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:31:36,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:31:36,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:31:36,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:31:36,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:31:36,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:31:36,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:31:37,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:31:37,001 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:31:37,032 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:31:37,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:31:37,033 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:31:37,033 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:31:37,033 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:31:37,033 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:31:37,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:31:37,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:31:37,034 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:31:37,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:31:37,035 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:31:37,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:31:37,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:31:37,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:31:37,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:31:37,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:31:37,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:31:37,037 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:31:37,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:31:37,037 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:31:37,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:31:37,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:31:37,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:31:37,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:31:37,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:31:37,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:31:37,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:31:37,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:31:37,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:31:37,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:31:37,039 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:31:37,039 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:31:37,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:31:37,039 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:31:37,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:31:37,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:31:37,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:31:37,305 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:31:37,305 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:31:37,306 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2022-04-27 10:31:37,363 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d7df12c/c434129c38cd4c6da91f9b60304486ca/FLAG48b977492 [2022-04-27 10:31:37,797 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:31:37,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2022-04-27 10:31:37,803 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d7df12c/c434129c38cd4c6da91f9b60304486ca/FLAG48b977492 [2022-04-27 10:31:37,818 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d7df12c/c434129c38cd4c6da91f9b60304486ca [2022-04-27 10:31:37,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:31:37,822 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:31:37,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:31:37,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:31:37,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:31:37,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:31:37" (1/1) ... [2022-04-27 10:31:37,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d1d724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:37, skipping insertion in model container [2022-04-27 10:31:37,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:31:37" (1/1) ... [2022-04-27 10:31:37,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:31:37,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:31:38,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c[373,386] [2022-04-27 10:31:38,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:31:38,082 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:31:38,096 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c[373,386] [2022-04-27 10:31:38,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:31:38,135 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:31:38,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38 WrapperNode [2022-04-27 10:31:38,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:31:38,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:31:38,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:31:38,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:31:38,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38" (1/1) ... [2022-04-27 10:31:38,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38" (1/1) ... [2022-04-27 10:31:38,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38" (1/1) ... [2022-04-27 10:31:38,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38" (1/1) ... [2022-04-27 10:31:38,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38" (1/1) ... [2022-04-27 10:31:38,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38" (1/1) ... [2022-04-27 10:31:38,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38" (1/1) ... [2022-04-27 10:31:38,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:31:38,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:31:38,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:31:38,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:31:38,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38" (1/1) ... [2022-04-27 10:31:38,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:31:38,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:38,245 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-27 10:31:38,256 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-27 10:31:38,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:31:38,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:31:38,289 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:31:38,289 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:31:38,291 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:31:38,291 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:31:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:31:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:31:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:31:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 10:31:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:31:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:31:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:31:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:31:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:31:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:31:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:31:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:31:38,347 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:31:38,349 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:31:38,574 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:31:38,580 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:31:38,580 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:31:38,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:31:38 BoogieIcfgContainer [2022-04-27 10:31:38,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:31:38,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:31:38,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:31:38,602 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:31:38,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:31:37" (1/3) ... [2022-04-27 10:31:38,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3332f314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:31:38, skipping insertion in model container [2022-04-27 10:31:38,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38" (2/3) ... [2022-04-27 10:31:38,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3332f314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:31:38, skipping insertion in model container [2022-04-27 10:31:38,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:31:38" (3/3) ... [2022-04-27 10:31:38,604 INFO L111 eAbstractionObserver]: Analyzing ICFG diamond_2-2.c [2022-04-27 10:31:38,616 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:31:38,635 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:31:38,692 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:31:38,701 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@413e723, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70e74131 [2022-04-27 10:31:38,701 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:31:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 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-27 10:31:38,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:31:38,713 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:38,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:38,715 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:38,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:38,721 INFO L85 PathProgramCache]: Analyzing trace with hash -154663714, now seen corresponding path program 1 times [2022-04-27 10:31:38,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:38,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076446456] [2022-04-27 10:31:38,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:38,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:38,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:38,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-27 10:31:38,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 10:31:38,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #96#return; {31#true} is VALID [2022-04-27 10:31:38,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:38,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-27 10:31:38,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 10:31:38,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #96#return; {31#true} is VALID [2022-04-27 10:31:38,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret6 := main(); {31#true} is VALID [2022-04-27 10:31:38,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {31#true} is VALID [2022-04-27 10:31:38,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#true} assume !true; {32#false} is VALID [2022-04-27 10:31:38,921 INFO L272 TraceCheckUtils]: 7: Hoare triple {32#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {32#false} is VALID [2022-04-27 10:31:38,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-27 10:31:38,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-27 10:31:38,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-27 10:31:38,923 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-27 10:31:38,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:38,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076446456] [2022-04-27 10:31:38,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076446456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:31:38,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:31:38,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:31:38,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329894641] [2022-04-27 10:31:38,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:38,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:31:38,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:38,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:38,955 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-27 10:31:38,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:31:38,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:38,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:31:38,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:31:38,983 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:39,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:39,102 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-04-27 10:31:39,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:31:39,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:31:39,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:39,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:39,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-27 10:31:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-27 10:31:39,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2022-04-27 10:31:39,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:39,203 INFO L225 Difference]: With dead ends: 39 [2022-04-27 10:31:39,203 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 10:31:39,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:31:39,208 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:39,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:31:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 10:31:39,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-27 10:31:39,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:39,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:39,248 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:39,249 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:39,252 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2022-04-27 10:31:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-27 10:31:39,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:39,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:39,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 10:31:39,253 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 10:31:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:39,256 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2022-04-27 10:31:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-27 10:31:39,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:39,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:39,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:39,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2022-04-27 10:31:39,261 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 11 [2022-04-27 10:31:39,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:39,261 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2022-04-27 10:31:39,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:39,262 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-27 10:31:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:31:39,262 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:39,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:39,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:31:39,263 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:39,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:39,264 INFO L85 PathProgramCache]: Analyzing trace with hash -213769058, now seen corresponding path program 1 times [2022-04-27 10:31:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:39,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939457405] [2022-04-27 10:31:39,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:39,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:39,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:39,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {160#true} is VALID [2022-04-27 10:31:39,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {160#true} assume true; {160#true} is VALID [2022-04-27 10:31:39,353 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {160#true} {160#true} #96#return; {160#true} is VALID [2022-04-27 10:31:39,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {160#true} call ULTIMATE.init(); {166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:39,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {160#true} is VALID [2022-04-27 10:31:39,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {160#true} assume true; {160#true} is VALID [2022-04-27 10:31:39,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160#true} {160#true} #96#return; {160#true} is VALID [2022-04-27 10:31:39,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {160#true} call #t~ret6 := main(); {160#true} is VALID [2022-04-27 10:31:39,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {160#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {165#(= main_~x~0 0)} is VALID [2022-04-27 10:31:39,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {165#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 99); {161#false} is VALID [2022-04-27 10:31:39,355 INFO L272 TraceCheckUtils]: 7: Hoare triple {161#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {161#false} is VALID [2022-04-27 10:31:39,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {161#false} ~cond := #in~cond; {161#false} is VALID [2022-04-27 10:31:39,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {161#false} assume 0 == ~cond; {161#false} is VALID [2022-04-27 10:31:39,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {161#false} assume !false; {161#false} is VALID [2022-04-27 10:31:39,356 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-27 10:31:39,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:39,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939457405] [2022-04-27 10:31:39,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939457405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:31:39,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:31:39,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:31:39,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969022959] [2022-04-27 10:31:39,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:39,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:31:39,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:39,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:31:39,370 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-27 10:31:39,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:31:39,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:39,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:31:39,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:31:39,372 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:31:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:39,538 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2022-04-27 10:31:39,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:31:39,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:31:39,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:31:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-27 10:31:39,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:31:39,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-27 10:31:39,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2022-04-27 10:31:39,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:39,598 INFO L225 Difference]: With dead ends: 29 [2022-04-27 10:31:39,598 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 10:31:39,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:31:39,600 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:39,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 36 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:31:39,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 10:31:39,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-27 10:31:39,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:39,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:39,606 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:39,607 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:39,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:39,609 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-04-27 10:31:39,609 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-04-27 10:31:39,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:39,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:39,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-27 10:31:39,610 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-27 10:31:39,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:39,612 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-04-27 10:31:39,612 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-04-27 10:31:39,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:39,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:39,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:39,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:39,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2022-04-27 10:31:39,619 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 11 [2022-04-27 10:31:39,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:39,620 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2022-04-27 10:31:39,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:31:39,620 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2022-04-27 10:31:39,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 10:31:39,621 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:39,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:39,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:31:39,621 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:39,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:39,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1726513949, now seen corresponding path program 1 times [2022-04-27 10:31:39,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:39,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155605633] [2022-04-27 10:31:39,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:39,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:39,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:39,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {289#true} is VALID [2022-04-27 10:31:39,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {289#true} assume true; {289#true} is VALID [2022-04-27 10:31:39,703 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {289#true} {289#true} #96#return; {289#true} is VALID [2022-04-27 10:31:39,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {289#true} call ULTIMATE.init(); {295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:39,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {289#true} is VALID [2022-04-27 10:31:39,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {289#true} assume true; {289#true} is VALID [2022-04-27 10:31:39,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {289#true} {289#true} #96#return; {289#true} is VALID [2022-04-27 10:31:39,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {289#true} call #t~ret6 := main(); {289#true} is VALID [2022-04-27 10:31:39,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {289#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {289#true} is VALID [2022-04-27 10:31:39,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {289#true} assume !!(~x~0 % 4294967296 < 99); {289#true} is VALID [2022-04-27 10:31:39,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {289#true} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {294#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-27 10:31:39,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {290#false} is VALID [2022-04-27 10:31:39,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {290#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {290#false} is VALID [2022-04-27 10:31:39,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {290#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {290#false} is VALID [2022-04-27 10:31:39,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {290#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {290#false} is VALID [2022-04-27 10:31:39,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {290#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {290#false} is VALID [2022-04-27 10:31:39,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {290#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {290#false} is VALID [2022-04-27 10:31:39,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {290#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {290#false} is VALID [2022-04-27 10:31:39,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {290#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {290#false} is VALID [2022-04-27 10:31:39,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {290#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {290#false} is VALID [2022-04-27 10:31:39,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {290#false} assume !(~x~0 % 4294967296 < 99); {290#false} is VALID [2022-04-27 10:31:39,709 INFO L272 TraceCheckUtils]: 18: Hoare triple {290#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {290#false} is VALID [2022-04-27 10:31:39,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {290#false} ~cond := #in~cond; {290#false} is VALID [2022-04-27 10:31:39,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {290#false} assume 0 == ~cond; {290#false} is VALID [2022-04-27 10:31:39,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {290#false} assume !false; {290#false} is VALID [2022-04-27 10:31:39,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:39,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:39,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155605633] [2022-04-27 10:31:39,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155605633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:31:39,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:31:39,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:31:39,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424364991] [2022-04-27 10:31:39,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:39,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 22 [2022-04-27 10:31:39,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:39,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-27 10:31:39,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:39,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:31:39,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:39,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:31:39,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:31:39,731 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-27 10:31:39,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:39,925 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2022-04-27 10:31:39,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:31:39,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 22 [2022-04-27 10:31:39,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:39,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-27 10:31:39,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-04-27 10:31:39,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-27 10:31:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-04-27 10:31:39,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 81 transitions. [2022-04-27 10:31:40,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:40,043 INFO L225 Difference]: With dead ends: 51 [2022-04-27 10:31:40,043 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 10:31:40,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:31:40,045 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 47 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:40,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 31 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:31:40,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 10:31:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-27 10:31:40,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:40,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:40,053 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:40,053 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:40,055 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-27 10:31:40,055 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-27 10:31:40,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:40,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:40,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-27 10:31:40,057 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-27 10:31:40,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:40,059 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-27 10:31:40,059 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-27 10:31:40,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:40,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:40,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:40,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:40,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-27 10:31:40,062 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 22 [2022-04-27 10:31:40,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:40,062 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-27 10:31:40,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-27 10:31:40,063 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-27 10:31:40,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 10:31:40,064 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:40,064 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:40,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 10:31:40,064 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:40,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:40,065 INFO L85 PathProgramCache]: Analyzing trace with hash 622763737, now seen corresponding path program 1 times [2022-04-27 10:31:40,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:40,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413964997] [2022-04-27 10:31:40,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:40,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:40,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:40,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {478#true} is VALID [2022-04-27 10:31:40,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#true} assume true; {478#true} is VALID [2022-04-27 10:31:40,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {478#true} {478#true} #96#return; {478#true} is VALID [2022-04-27 10:31:40,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {478#true} call ULTIMATE.init(); {487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:40,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {478#true} is VALID [2022-04-27 10:31:40,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {478#true} assume true; {478#true} is VALID [2022-04-27 10:31:40,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {478#true} {478#true} #96#return; {478#true} is VALID [2022-04-27 10:31:40,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {478#true} call #t~ret6 := main(); {478#true} is VALID [2022-04-27 10:31:40,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {478#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {483#(= main_~x~0 0)} is VALID [2022-04-27 10:31:40,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {483#(= main_~x~0 0)} is VALID [2022-04-27 10:31:40,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {483#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 10:31:40,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 10:31:40,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 10:31:40,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 10:31:40,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 10:31:40,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 10:31:40,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 4 + ~x~0; {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 10:31:40,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 10:31:40,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 10:31:40,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 10:31:40,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} assume !(~x~0 % 4294967296 < 99); {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} is VALID [2022-04-27 10:31:40,484 INFO L272 TraceCheckUtils]: 18: Hoare triple {484#(and (not (<= main_~y~0 (* (div main_~y~0 2) 2))) (<= main_~x~0 (+ (* 2 (div (+ (* (div main_~y~0 2) 2) main_~x~0 (* (- 1) main_~y~0)) 2)) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {485#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:31:40,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {485#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {486#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:31:40,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {486#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {479#false} is VALID [2022-04-27 10:31:40,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {479#false} assume !false; {479#false} is VALID [2022-04-27 10:31:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:40,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:40,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413964997] [2022-04-27 10:31:40,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413964997] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:40,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521168733] [2022-04-27 10:31:40,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:40,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:40,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:40,495 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-27 10:31:40,531 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-27 10:31:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:40,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 10:31:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:40,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:41,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {478#true} call ULTIMATE.init(); {478#true} is VALID [2022-04-27 10:31:41,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {478#true} is VALID [2022-04-27 10:31:41,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {478#true} assume true; {478#true} is VALID [2022-04-27 10:31:41,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {478#true} {478#true} #96#return; {478#true} is VALID [2022-04-27 10:31:41,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {478#true} call #t~ret6 := main(); {478#true} is VALID [2022-04-27 10:31:41,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {478#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {483#(= main_~x~0 0)} is VALID [2022-04-27 10:31:41,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {483#(= main_~x~0 0)} is VALID [2022-04-27 10:31:41,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {483#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {512#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 1))} is VALID [2022-04-27 10:31:41,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {516#(and (= (- 1) main_~x~0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 10:31:41,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {516#(and (= (- 1) main_~x~0) (not (= (mod main_~y~0 2) 0)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {512#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 1))} is VALID [2022-04-27 10:31:41,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {512#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {516#(and (= (- 1) main_~x~0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 10:31:41,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {516#(and (= (- 1) main_~x~0) (not (= (mod main_~y~0 2) 0)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {512#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 1))} is VALID [2022-04-27 10:31:41,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {529#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 (- 3)))} is VALID [2022-04-27 10:31:41,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {529#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 (- 3)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 4 + ~x~0; {512#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 1))} is VALID [2022-04-27 10:31:41,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {536#(and (= main_~x~0 3) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 10:31:41,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {536#(and (= main_~x~0 3) (not (= (mod main_~y~0 2) 0)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {516#(and (= (- 1) main_~x~0) (not (= (mod main_~y~0 2) 0)))} is VALID [2022-04-27 10:31:41,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {516#(and (= (- 1) main_~x~0) (not (= (mod main_~y~0 2) 0)))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {543#(and (not (= (mod main_~y~0 2) 0)) (= (- 1) (+ main_~x~0 4)))} is VALID [2022-04-27 10:31:41,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {543#(and (not (= (mod main_~y~0 2) 0)) (= (- 1) (+ main_~x~0 4)))} assume !(~x~0 % 4294967296 < 99); {543#(and (not (= (mod main_~y~0 2) 0)) (= (- 1) (+ main_~x~0 4)))} is VALID [2022-04-27 10:31:41,189 INFO L272 TraceCheckUtils]: 18: Hoare triple {543#(and (not (= (mod main_~y~0 2) 0)) (= (- 1) (+ main_~x~0 4)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {550#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:31:41,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {550#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {554#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:31:41,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {554#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {479#false} is VALID [2022-04-27 10:31:41,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {479#false} assume !false; {479#false} is VALID [2022-04-27 10:31:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:41,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:41,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {479#false} assume !false; {479#false} is VALID [2022-04-27 10:31:41,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {554#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {479#false} is VALID [2022-04-27 10:31:41,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {550#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {554#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:31:41,692 INFO L272 TraceCheckUtils]: 18: Hoare triple {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {550#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:31:41,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:41,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:41,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:41,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:41,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 4 + ~x~0; {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:41,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:41,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:41,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:41,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:41,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:41,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#(<= 1 (mod (+ main_~x~0 1) 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {570#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:41,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {604#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~x~0 % 4294967296 < 99); {604#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:41,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {478#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {604#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:41,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {478#true} call #t~ret6 := main(); {478#true} is VALID [2022-04-27 10:31:41,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {478#true} {478#true} #96#return; {478#true} is VALID [2022-04-27 10:31:41,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {478#true} assume true; {478#true} is VALID [2022-04-27 10:31:41,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {478#true} is VALID [2022-04-27 10:31:41,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {478#true} call ULTIMATE.init(); {478#true} is VALID [2022-04-27 10:31:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:41,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521168733] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:41,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:41,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 6] total 16 [2022-04-27 10:31:41,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444086193] [2022-04-27 10:31:41,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:41,710 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 10:31:41,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:41,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:41,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:41,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 10:31:41,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:41,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 10:31:41,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-27 10:31:41,771 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:42,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:42,404 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2022-04-27 10:31:42,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 10:31:42,404 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 10:31:42,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-27 10:31:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 62 transitions. [2022-04-27 10:31:42,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 62 transitions. [2022-04-27 10:31:42,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:42,474 INFO L225 Difference]: With dead ends: 49 [2022-04-27 10:31:42,474 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:31:42,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2022-04-27 10:31:42,476 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:42,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 35 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:31:42,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:31:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:31:42,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:42,478 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-27 10:31:42,478 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-27 10:31:42,478 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-27 10:31:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:42,478 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:31:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:31:42,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:42,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:42,479 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-27 10:31:42,479 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-27 10:31:42,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:42,479 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:31:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:31:42,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:42,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:42,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:42,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:42,480 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-27 10:31:42,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:31:42,480 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-27 10:31:42,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:42,480 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:31:42,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:31:42,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:42,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:31:42,515 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-27 10:31:42,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:42,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:31:42,780 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 10:31:42,781 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 10:31:42,781 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 10:31:42,781 INFO L899 garLoopResultBuilder]: For program point L27-1(lines 17 47) no Hoare annotation was computed. [2022-04-27 10:31:42,781 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 13 50) no Hoare annotation was computed. [2022-04-27 10:31:42,781 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 17 47) no Hoare annotation was computed. [2022-04-27 10:31:42,781 INFO L899 garLoopResultBuilder]: For program point L24-1(lines 17 47) no Hoare annotation was computed. [2022-04-27 10:31:42,781 INFO L895 garLoopResultBuilder]: At program point L45-1(lines 17 47) the Hoare annotation is: (or (= main_~x~0 0) (and (= (+ 5 main_~x~0) 0) (not (= (* (div main_~y~0 2) 2) main_~y~0))) (and (<= 1 (mod (+ main_~x~0 1) 2)) (= (mod main_~x~0 2) (mod main_~y~0 2)))) [2022-04-27 10:31:42,781 INFO L899 garLoopResultBuilder]: For program point L33-1(lines 17 47) no Hoare annotation was computed. [2022-04-27 10:31:42,782 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 17 47) no Hoare annotation was computed. [2022-04-27 10:31:42,782 INFO L895 garLoopResultBuilder]: At program point L17-2(lines 17 47) the Hoare annotation is: (let ((.cse0 (mod main_~y~0 2))) (or (and (not (= .cse0 0)) (= (- 1) (+ main_~x~0 4))) (and (<= 1 (mod (+ main_~x~0 1) 2)) (= (mod main_~x~0 2) .cse0)))) [2022-04-27 10:31:42,782 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 13 50) no Hoare annotation was computed. [2022-04-27 10:31:42,782 INFO L899 garLoopResultBuilder]: For program point L42-1(lines 17 47) no Hoare annotation was computed. [2022-04-27 10:31:42,782 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 13 50) the Hoare annotation is: true [2022-04-27 10:31:42,782 INFO L899 garLoopResultBuilder]: For program point L30-1(lines 17 47) no Hoare annotation was computed. [2022-04-27 10:31:42,782 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 19) no Hoare annotation was computed. [2022-04-27 10:31:42,782 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 47) no Hoare annotation was computed. [2022-04-27 10:31:42,782 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 17 47) no Hoare annotation was computed. [2022-04-27 10:31:42,783 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:31:42,783 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 10:31:42,783 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:31:42,783 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:31:42,783 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:31:42,783 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:31:42,783 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:31:42,783 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2022-04-27 10:31:42,783 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2022-04-27 10:31:42,784 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-27 10:31:42,784 INFO L899 garLoopResultBuilder]: For program point L7(lines 7 9) no Hoare annotation was computed. [2022-04-27 10:31:42,784 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2022-04-27 10:31:42,784 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2022-04-27 10:31:42,787 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 10:31:42,788 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:31:42,795 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:31:42,795 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:31:42,797 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:31:42,797 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:31:42,797 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:31:42,798 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:31:42,800 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:31:42,803 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:31:42,803 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:31:42,803 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:31:42,803 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:31:42,803 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:31:42,803 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:31:42,803 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:31:42,803 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 10:31:42,803 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 10:31:42,804 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 10:31:42,804 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:31:42,804 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:31:42,804 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 10:31:42,804 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:31:42,804 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:31:42,804 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-04-27 10:31:42,804 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-04-27 10:31:42,804 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 10:31:42,804 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 10:31:42,804 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 10:31:42,804 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 10:31:42,804 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 10:31:42,804 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 10:31:42,804 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 10:31:42,804 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 10:31:42,805 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 10:31:42,805 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 10:31:42,805 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 10:31:42,805 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 10:31:42,805 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-04-27 10:31:42,805 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-04-27 10:31:42,805 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:31:42,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:31:42 BoogieIcfgContainer [2022-04-27 10:31:42,825 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:31:42,827 INFO L158 Benchmark]: Toolchain (without parser) took 5004.18ms. Allocated memory was 189.8MB in the beginning and 292.6MB in the end (delta: 102.8MB). Free memory was 132.7MB in the beginning and 268.5MB in the end (delta: -135.7MB). Peak memory consumption was 137.2MB. Max. memory is 8.0GB. [2022-04-27 10:31:42,829 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 189.8MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:31:42,829 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.75ms. Allocated memory is still 189.8MB. Free memory was 132.5MB in the beginning and 162.7MB in the end (delta: -30.2MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-04-27 10:31:42,829 INFO L158 Benchmark]: Boogie Preprocessor took 64.96ms. Allocated memory is still 189.8MB. Free memory was 162.7MB in the beginning and 160.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:31:42,830 INFO L158 Benchmark]: RCFGBuilder took 380.02ms. Allocated memory is still 189.8MB. Free memory was 160.6MB in the beginning and 148.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 10:31:42,832 INFO L158 Benchmark]: TraceAbstraction took 4241.60ms. Allocated memory was 189.8MB in the beginning and 292.6MB in the end (delta: 102.8MB). Free memory was 147.5MB in the beginning and 268.5MB in the end (delta: -120.9MB). Peak memory consumption was 152.1MB. Max. memory is 8.0GB. [2022-04-27 10:31:42,834 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.44ms. Allocated memory is still 189.8MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 302.75ms. Allocated memory is still 189.8MB. Free memory was 132.5MB in the beginning and 162.7MB in the end (delta: -30.2MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.96ms. Allocated memory is still 189.8MB. Free memory was 162.7MB in the beginning and 160.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 380.02ms. Allocated memory is still 189.8MB. Free memory was 160.6MB in the beginning and 148.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4241.60ms. Allocated memory was 189.8MB in the beginning and 292.6MB in the end (delta: 102.8MB). Free memory was 147.5MB in the beginning and 268.5MB in the end (delta: -120.9MB). Peak memory consumption was 152.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 142 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 271 IncrementalHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 98 mSDtfsCounter, 271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=3, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 17 NumberOfFragments, 72 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 628 SizeOfPredicates, 2 NumberOfNonLiveVariables, 84 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 1/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (x == 0 || (5 + x == 0 && !(y / 2 * 2 == y))) || (1 <= (x + 1) % 2 && x % 2 == y % 2) RESULT: Ultimate proved your program to be correct! [2022-04-27 10:31:42,867 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...