/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-industry-pattern/mod3.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:58:07,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:58:07,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:58:07,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:58:07,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:58:07,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:58:07,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:58:07,162 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:58:07,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:58:07,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:58:07,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:58:07,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:58:07,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:58:07,170 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:58:07,170 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:58:07,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:58:07,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:58:07,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:58:07,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:58:07,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:58:07,179 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:58:07,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:58:07,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:58:07,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:58:07,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:58:07,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:58:07,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:58:07,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:58:07,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:58:07,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:58:07,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:58:07,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:58:07,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:58:07,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:58:07,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:58:07,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:58:07,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:58:07,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:58:07,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:58:07,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:58:07,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:58:07,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:58:07,193 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:58:07,220 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:58:07,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:58:07,220 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:58:07,220 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:58:07,220 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:58:07,221 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:58:07,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:58:07,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:58:07,221 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:58:07,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:58:07,221 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:58:07,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:58:07,221 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:58:07,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:58:07,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:58:07,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:58:07,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:58:07,222 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:58:07,222 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:58:07,222 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:58:07,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:58:07,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:58:07,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:58:07,222 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:58:07,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:58:07,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:58:07,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:58:07,223 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:58:07,223 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:58:07,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:58:07,223 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:58:07,223 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:58:07,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:58:07,223 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:58:07,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:58:07,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:58:07,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:58:07,428 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:58:07,428 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:58:07,429 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c [2022-04-27 10:58:07,471 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25379c13a/f8a86438ef204b49bb97864b64464e4c/FLAGd4facdb18 [2022-04-27 10:58:07,821 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:58:07,822 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c [2022-04-27 10:58:07,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25379c13a/f8a86438ef204b49bb97864b64464e4c/FLAGd4facdb18 [2022-04-27 10:58:07,846 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25379c13a/f8a86438ef204b49bb97864b64464e4c [2022-04-27 10:58:07,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:58:07,849 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:58:07,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:58:07,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:58:07,854 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:58:07,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:58:07" (1/1) ... [2022-04-27 10:58:07,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ad0c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:07, skipping insertion in model container [2022-04-27 10:58:07,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:58:07" (1/1) ... [2022-04-27 10:58:07,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:58:07,877 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:58:08,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c[2057,2070] [2022-04-27 10:58:08,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:58:08,072 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:58:08,103 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c[2057,2070] [2022-04-27 10:58:08,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:58:08,118 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:58:08,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:08 WrapperNode [2022-04-27 10:58:08,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:58:08,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:58:08,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:58:08,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:58:08,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:08" (1/1) ... [2022-04-27 10:58:08,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:08" (1/1) ... [2022-04-27 10:58:08,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:08" (1/1) ... [2022-04-27 10:58:08,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:08" (1/1) ... [2022-04-27 10:58:08,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:08" (1/1) ... [2022-04-27 10:58:08,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:08" (1/1) ... [2022-04-27 10:58:08,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:08" (1/1) ... [2022-04-27 10:58:08,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:58:08,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:58:08,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:58:08,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:58:08,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:08" (1/1) ... [2022-04-27 10:58:08,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:58:08,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:58:08,184 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:58:08,193 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:58:08,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:58:08,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:58:08,225 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:58:08,225 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:58:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:58:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:58:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:58:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:58:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:58:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:58:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:58:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:58:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:58:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:58:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:58:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:58:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:58:08,288 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:58:08,290 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:58:17,098 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:58:17,102 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:58:17,103 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 10:58:17,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:58:17 BoogieIcfgContainer [2022-04-27 10:58:17,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:58:17,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:58:17,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:58:17,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:58:17,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:58:07" (1/3) ... [2022-04-27 10:58:17,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292a73d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:58:17, skipping insertion in model container [2022-04-27 10:58:17,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:08" (2/3) ... [2022-04-27 10:58:17,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292a73d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:58:17, skipping insertion in model container [2022-04-27 10:58:17,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:58:17" (3/3) ... [2022-04-27 10:58:17,109 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.c.v+sep-reducer.c [2022-04-27 10:58:17,117 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:58:17,117 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:58:17,144 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:58:17,148 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@7b935006, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6b1834b6 [2022-04-27 10:58:17,148 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:58:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:58:17,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:58:17,157 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:58:17,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:58:17,158 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:58:17,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:58:17,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1267928218, now seen corresponding path program 1 times [2022-04-27 10:58:17,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:58:17,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441157925] [2022-04-27 10:58:17,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:58:17,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:58:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:17,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:58:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:17,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_31_0~0 := 0;~__tmp_28_0~0 := 0;~__return_65~0 := 0;~__tmp_22_0~0 := 0;~__tmp_22_1~0 := 0;~__tmp_25_0~0 := 0;~__tmp_25_1~0 := 0; {31#true} is VALID [2022-04-27 10:58:17,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 10:58:17,742 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #72#return; {31#true} is VALID [2022-04-27 10:58:17,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {39#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:58:17,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_31_0~0 := 0;~__tmp_28_0~0 := 0;~__return_65~0 := 0;~__tmp_22_0~0 := 0;~__tmp_22_1~0 := 0;~__tmp_25_0~0 := 0;~__tmp_25_1~0 := 0; {31#true} is VALID [2022-04-27 10:58:17,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 10:58:17,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #72#return; {31#true} is VALID [2022-04-27 10:58:17,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret9 := main(); {31#true} is VALID [2022-04-27 10:58:17,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-27 10:58:17,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-27 10:58:17,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} assume !(0 == ~main____CPAchecker_TMP_0~0); {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-27 10:58:19,889 WARN L290 TraceCheckUtils]: 8: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} assume 1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296;~main__x~0 := 2 + ~main__x~0;~main__y~0 := 0;~__tmp_31_0~0 := ~main____CPAchecker_TMP_0~0; {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-27 10:58:19,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_31_0~0; {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 10:58:19,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 10:58:19,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume !!(0 == ~main____CPAchecker_TMP_0~1); {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 10:58:19,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {38#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 10:58:19,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {32#false} is VALID [2022-04-27 10:58:19,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-27 10:58:19,901 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:58:19,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:58:19,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441157925] [2022-04-27 10:58:19,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441157925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:58:19,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:58:19,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:58:19,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085815003] [2022-04-27 10:58:19,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:58:19,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:58:19,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:58:19,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:22,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 10:58:22,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:58:22,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:58:22,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:58:22,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:58:22,091 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:24,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:28,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:30,766 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:33,089 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:39,590 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:48,234 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:56,990 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:01,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:03,520 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:05,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:07,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:10,081 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:10,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:59:10,096 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2022-04-27 10:59:10,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:59:10,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:59:10,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:59:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:59:10,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-27 10:59:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:59:10,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-27 10:59:10,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2022-04-27 10:59:12,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 98 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 10:59:12,370 INFO L225 Difference]: With dead ends: 71 [2022-04-27 10:59:12,370 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 10:59:12,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:59:12,374 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2022-04-27 10:59:12,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 95 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 11 Unknown, 0 Unchecked, 25.4s Time] [2022-04-27 10:59:12,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 10:59:12,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-27 10:59:12,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:59:12,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:59:12,420 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:59:12,421 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:59:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:59:12,423 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-27 10:59:12,423 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-27 10:59:12,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:59:12,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:59:12,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-27 10:59:12,424 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-27 10:59:12,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:59:12,427 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-27 10:59:12,427 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-27 10:59:12,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:59:12,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:59:12,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:59:12,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:59:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:59:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-04-27 10:59:12,430 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 15 [2022-04-27 10:59:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:59:12,431 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-04-27 10:59:12,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:59:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-27 10:59:12,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:59:12,431 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:59:12,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:59:12,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:59:12,432 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:59:12,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:59:12,433 INFO L85 PathProgramCache]: Analyzing trace with hash -900894010, now seen corresponding path program 1 times [2022-04-27 10:59:12,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:59:12,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447922692] [2022-04-27 10:59:12,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:59:12,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:59:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:59:12,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:59:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:59:12,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {259#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_31_0~0 := 0;~__tmp_28_0~0 := 0;~__return_65~0 := 0;~__tmp_22_0~0 := 0;~__tmp_22_1~0 := 0;~__tmp_25_0~0 := 0;~__tmp_25_1~0 := 0; {251#true} is VALID [2022-04-27 10:59:12,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-27 10:59:12,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {251#true} {251#true} #72#return; {251#true} is VALID [2022-04-27 10:59:12,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {259#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:59:12,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {259#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_31_0~0 := 0;~__tmp_28_0~0 := 0;~__return_65~0 := 0;~__tmp_22_0~0 := 0;~__tmp_22_1~0 := 0;~__tmp_25_0~0 := 0;~__tmp_25_1~0 := 0; {251#true} is VALID [2022-04-27 10:59:12,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-27 10:59:12,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #72#return; {251#true} is VALID [2022-04-27 10:59:12,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret9 := main(); {251#true} is VALID [2022-04-27 10:59:12,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-27 10:59:12,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-27 10:59:12,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} assume !(0 == ~main____CPAchecker_TMP_0~0); {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-27 10:59:12,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} assume !(1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296); {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-27 10:59:14,918 WARN L290 TraceCheckUtils]: 9: Hoare triple {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} assume 2 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296;~main__x~0 := 1 + ~main__x~0;~main__y~0 := 0;~__tmp_28_0~0 := ~main____CPAchecker_TMP_0~0; {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-27 10:59:14,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_28_0~0; {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 10:59:14,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 10:59:14,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume !!(0 == ~main____CPAchecker_TMP_0~1); {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 10:59:14,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {258#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 10:59:14,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {258#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {252#false} is VALID [2022-04-27 10:59:14,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-27 10:59:14,933 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:59:14,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:59:14,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447922692] [2022-04-27 10:59:14,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447922692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:59:14,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:59:14,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:59:14,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065911716] [2022-04-27 10:59:14,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:59:14,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 10:59:14,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:59:14,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:59:17,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 10:59:17,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:59:17,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:59:17,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:59:17,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:59:17,133 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:59:21,463 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:23,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:25,748 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:28,000 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:30,172 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:32,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:34,721 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:36,937 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:39,112 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:41,287 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:43,538 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:45,691 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:47,857 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:50,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:56,616 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:00,923 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:05,284 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:09,626 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:13,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:16,174 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:18,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:18,559 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2022-04-27 11:00:18,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:00:18,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 11:00:18,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:00:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-27 11:00:18,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-27 11:00:18,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-04-27 11:00:20,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 73 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:00:20,801 INFO L225 Difference]: With dead ends: 60 [2022-04-27 11:00:20,801 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 11:00:20,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:00:20,802 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:00:20,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 81 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 20 Unknown, 0 Unchecked, 42.3s Time] [2022-04-27 11:00:20,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 11:00:20,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-04-27 11:00:20,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:00:20,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:20,828 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:20,828 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:20,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:20,830 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 11:00:20,830 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-27 11:00:20,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:00:20,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:00:20,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-27 11:00:20,831 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-27 11:00:20,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:20,837 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 11:00:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-27 11:00:20,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:00:20,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:00:20,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:00:20,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:00:20,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:20,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-27 11:00:20,842 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 16 [2022-04-27 11:00:20,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:00:20,842 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-27 11:00:20,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-27 11:00:20,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 11:00:20,844 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:00:20,845 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:00:20,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:00:20,848 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:00:20,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:00:20,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2097589807, now seen corresponding path program 1 times [2022-04-27 11:00:20,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:00:20,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391620865] [2022-04-27 11:00:20,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:00:20,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:00:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:21,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:00:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:21,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {482#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_31_0~0 := 0;~__tmp_28_0~0 := 0;~__return_65~0 := 0;~__tmp_22_0~0 := 0;~__tmp_22_1~0 := 0;~__tmp_25_0~0 := 0;~__tmp_25_1~0 := 0; {475#true} is VALID [2022-04-27 11:00:21,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {475#true} assume true; {475#true} is VALID [2022-04-27 11:00:21,035 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {475#true} {475#true} #72#return; {475#true} is VALID [2022-04-27 11:00:21,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {475#true} call ULTIMATE.init(); {482#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:00:21,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_31_0~0 := 0;~__tmp_28_0~0 := 0;~__return_65~0 := 0;~__tmp_22_0~0 := 0;~__tmp_22_1~0 := 0;~__tmp_25_0~0 := 0;~__tmp_25_1~0 := 0; {475#true} is VALID [2022-04-27 11:00:21,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {475#true} assume true; {475#true} is VALID [2022-04-27 11:00:21,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {475#true} {475#true} #72#return; {475#true} is VALID [2022-04-27 11:00:21,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {475#true} call #t~ret9 := main(); {475#true} is VALID [2022-04-27 11:00:21,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {475#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {475#true} is VALID [2022-04-27 11:00:21,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {475#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {475#true} is VALID [2022-04-27 11:00:21,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {475#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {475#true} is VALID [2022-04-27 11:00:21,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {475#true} assume !(1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296); {475#true} is VALID [2022-04-27 11:00:21,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {475#true} assume !(2 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296);havoc ~main____CPAchecker_TMP_1~1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~1 := #t~nondet8;havoc #t~nondet8; {475#true} is VALID [2022-04-27 11:00:21,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {475#true} assume !(0 == ~main____CPAchecker_TMP_1~1);~main__x~0 := 4 + ~main__x~0;~main__y~0 := 1;~__tmp_22_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_22_1~0 := ~main____CPAchecker_TMP_1~1; {475#true} is VALID [2022-04-27 11:00:21,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {475#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_22_0~0;~main____CPAchecker_TMP_1~1 := ~__tmp_22_1~0; {475#true} is VALID [2022-04-27 11:00:21,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {475#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {475#true} is VALID [2022-04-27 11:00:21,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {475#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {475#true} is VALID [2022-04-27 11:00:23,219 WARN L290 TraceCheckUtils]: 14: Hoare triple {475#true} assume 1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296;~main__x~0 := 2 + ~main__x~0;~main__y~0 := 0;~__tmp_31_0~0 := ~main____CPAchecker_TMP_0~0; {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-27 11:00:23,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_31_0~0; {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:00:23,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:00:23,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume !!(0 == ~main____CPAchecker_TMP_0~1); {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:00:23,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {481#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 11:00:23,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {481#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {476#false} is VALID [2022-04-27 11:00:23,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {476#false} assume !false; {476#false} is VALID [2022-04-27 11:00:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:00:23,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:00:23,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391620865] [2022-04-27 11:00:23,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391620865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:00:23,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:00:23,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:00:23,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286250215] [2022-04-27 11:00:23,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:00:23,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 11:00:23,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:00:23,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:25,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:00:25,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:00:25,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:00:25,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:00:25,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:00:25,443 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:29,681 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:31,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:38,449 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:40,628 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:45,113 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:49,484 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:51,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:58,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:02,566 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:04,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:07,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:07,113 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-04-27 11:01:07,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:01:07,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 11:01:07,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:01:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-27 11:01:07,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-27 11:01:07,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2022-04-27 11:01:11,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 72 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 11:01:11,550 INFO L225 Difference]: With dead ends: 65 [2022-04-27 11:01:11,551 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 11:01:11,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:01:11,551 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:01:11,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 56 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 10 Unknown, 0 Unchecked, 21.0s Time] [2022-04-27 11:01:11,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 11:01:11,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-04-27 11:01:11,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:01:11,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:11,561 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:11,562 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:11,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:11,566 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-27 11:01:11,566 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-27 11:01:11,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:11,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:11,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-27 11:01:11,567 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-27 11:01:11,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:11,568 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-27 11:01:11,568 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-27 11:01:11,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:11,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:11,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:01:11,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:01:11,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-27 11:01:11,570 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 21 [2022-04-27 11:01:11,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:01:11,570 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-27 11:01:11,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-27 11:01:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:01:11,571 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:01:11,571 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:01:11,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 11:01:11,571 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:01:11,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:01:11,571 INFO L85 PathProgramCache]: Analyzing trace with hash -951188527, now seen corresponding path program 1 times [2022-04-27 11:01:11,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:01:11,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274448884] [2022-04-27 11:01:11,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:01:11,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:01:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:11,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:01:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:11,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {720#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_31_0~0 := 0;~__tmp_28_0~0 := 0;~__return_65~0 := 0;~__tmp_22_0~0 := 0;~__tmp_22_1~0 := 0;~__tmp_25_0~0 := 0;~__tmp_25_1~0 := 0; {713#true} is VALID [2022-04-27 11:01:11,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {713#true} assume true; {713#true} is VALID [2022-04-27 11:01:11,755 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {713#true} {713#true} #72#return; {713#true} is VALID [2022-04-27 11:01:11,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {713#true} call ULTIMATE.init(); {720#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:01:11,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {720#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_31_0~0 := 0;~__tmp_28_0~0 := 0;~__return_65~0 := 0;~__tmp_22_0~0 := 0;~__tmp_22_1~0 := 0;~__tmp_25_0~0 := 0;~__tmp_25_1~0 := 0; {713#true} is VALID [2022-04-27 11:01:11,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {713#true} assume true; {713#true} is VALID [2022-04-27 11:01:11,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {713#true} {713#true} #72#return; {713#true} is VALID [2022-04-27 11:01:11,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {713#true} call #t~ret9 := main(); {713#true} is VALID [2022-04-27 11:01:11,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {713#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {713#true} is VALID [2022-04-27 11:01:11,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {713#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {713#true} is VALID [2022-04-27 11:01:11,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {713#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {713#true} is VALID [2022-04-27 11:01:11,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {713#true} assume !(1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296); {713#true} is VALID [2022-04-27 11:01:11,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {713#true} assume !(2 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296);havoc ~main____CPAchecker_TMP_1~1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~1 := #t~nondet8;havoc #t~nondet8; {713#true} is VALID [2022-04-27 11:01:11,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {713#true} assume !(0 == ~main____CPAchecker_TMP_1~1);~main__x~0 := 4 + ~main__x~0;~main__y~0 := 1;~__tmp_22_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_22_1~0 := ~main____CPAchecker_TMP_1~1; {713#true} is VALID [2022-04-27 11:01:11,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {713#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_22_0~0;~main____CPAchecker_TMP_1~1 := ~__tmp_22_1~0; {713#true} is VALID [2022-04-27 11:01:11,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {713#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {713#true} is VALID [2022-04-27 11:01:11,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {713#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {713#true} is VALID [2022-04-27 11:01:11,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {713#true} assume !(1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296); {713#true} is VALID [2022-04-27 11:01:13,939 WARN L290 TraceCheckUtils]: 15: Hoare triple {713#true} assume 2 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296;~main__x~0 := 1 + ~main__x~0;~main__y~0 := 0;~__tmp_28_0~0 := ~main____CPAchecker_TMP_0~0; {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-27 11:01:13,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_28_0~0; {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:01:13,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:01:13,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume !!(0 == ~main____CPAchecker_TMP_0~1); {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:01:13,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {719#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 11:01:13,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {719#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {714#false} is VALID [2022-04-27 11:01:13,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {714#false} assume !false; {714#false} is VALID [2022-04-27 11:01:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:01:13,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:01:13,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274448884] [2022-04-27 11:01:13,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274448884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:01:13,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:01:13,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:01:13,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365413843] [2022-04-27 11:01:13,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:01:13,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 11:01:13,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:01:13,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:16,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:01:16,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:01:16,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:01:16,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:01:16,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:01:16,148 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:20,379 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:22,556 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:24,716 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:29,112 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:33,482 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:37,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:42,321 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:44,497 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:48,850 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:49,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:49,016 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-27 11:01:49,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:01:49,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 11:01:49,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:01:49,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 11:01:49,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:49,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 11:01:49,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 11:01:53,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 63 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 11:01:53,465 INFO L225 Difference]: With dead ends: 59 [2022-04-27 11:01:53,465 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:01:53,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:01:53,467 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:01:53,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 59 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 9 Unknown, 0 Unchecked, 19.1s Time] [2022-04-27 11:01:53,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:01:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:01:53,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:01:53,468 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 11:01:53,468 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 11:01:53,468 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 11:01:53,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:53,468 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:01:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:01:53,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:53,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:53,468 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 11:01:53,468 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 11:01:53,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:53,468 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:01:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:01:53,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:53,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:53,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:01:53,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:01:53,469 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 11:01:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:01:53,469 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-27 11:01:53,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:01:53,469 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:01:53,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:53,469 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:01:53,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:53,471 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:01:53,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 11:01:53,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:01:53,522 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-27 11:01:53,522 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-27 11:01:53,523 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-27 11:01:53,523 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-04-27 11:01:53,523 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 15 147) no Hoare annotation was computed. [2022-04-27 11:01:53,523 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 83) no Hoare annotation was computed. [2022-04-27 11:01:53,523 INFO L895 garLoopResultBuilder]: At program point L52(lines 24 141) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-27 11:01:53,523 INFO L902 garLoopResultBuilder]: At program point L135(lines 35 140) the Hoare annotation is: true [2022-04-27 11:01:53,523 INFO L895 garLoopResultBuilder]: At program point L61(lines 36 112) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-27 11:01:53,523 INFO L902 garLoopResultBuilder]: At program point L123(lines 35 140) the Hoare annotation is: true [2022-04-27 11:01:53,523 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 141) no Hoare annotation was computed. [2022-04-27 11:01:53,524 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 111) no Hoare annotation was computed. [2022-04-27 11:01:53,524 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 104) no Hoare annotation was computed. [2022-04-27 11:01:53,524 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 15 147) no Hoare annotation was computed. [2022-04-27 11:01:53,524 INFO L895 garLoopResultBuilder]: At program point L42(lines 24 141) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-27 11:01:53,524 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 82) no Hoare annotation was computed. [2022-04-27 11:01:53,524 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2022-04-27 11:01:53,524 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 15 147) the Hoare annotation is: (and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0)) [2022-04-27 11:01:53,524 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 110) no Hoare annotation was computed. [2022-04-27 11:01:53,524 INFO L899 garLoopResultBuilder]: For program point L22(lines 22 146) no Hoare annotation was computed. [2022-04-27 11:01:53,524 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 139) no Hoare annotation was computed. [2022-04-27 11:01:53,524 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 84) no Hoare annotation was computed. [2022-04-27 11:01:53,524 INFO L902 garLoopResultBuilder]: At program point L138(lines 16 147) the Hoare annotation is: true [2022-04-27 11:01:53,525 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 140) no Hoare annotation was computed. [2022-04-27 11:01:53,525 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:01:53,525 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 11:01:53,525 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:01:53,525 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:01:53,525 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:01:53,525 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:01:53,525 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:01:53,527 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 11:01:53,529 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:01:53,531 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:01:53,531 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:01:53,532 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 11:01:53,532 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:01:53,532 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:01:53,533 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 11:01:53,533 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:01:53,533 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:01:53,533 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 11:01:53,533 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 11:01:53,533 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 11:01:53,533 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 11:01:53,533 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:01:53,534 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 11:01:53,534 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 11:01:53,534 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:01:53,534 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 11:01:53,535 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 11:01:53,535 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 11:01:53,535 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 11:01:53,535 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 11:01:53,535 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 11:01:53,535 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 11:01:53,535 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-04-27 11:01:53,535 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-04-27 11:01:53,535 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-27 11:01:53,535 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-27 11:01:53,535 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-04-27 11:01:53,535 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-04-27 11:01:53,535 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-04-27 11:01:53,535 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-04-27 11:01:53,535 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-04-27 11:01:53,536 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-04-27 11:01:53,536 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 11:01:53,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:01:53 BoogieIcfgContainer [2022-04-27 11:01:53,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:01:53,549 INFO L158 Benchmark]: Toolchain (without parser) took 225699.97ms. Allocated memory was 196.1MB in the beginning and 280.0MB in the end (delta: 83.9MB). Free memory was 145.4MB in the beginning and 219.2MB in the end (delta: -73.8MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-04-27 11:01:53,549 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 196.1MB. Free memory is still 161.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:01:53,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.33ms. Allocated memory is still 196.1MB. Free memory was 145.3MB in the beginning and 170.2MB in the end (delta: -24.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 11:01:53,550 INFO L158 Benchmark]: Boogie Preprocessor took 39.88ms. Allocated memory is still 196.1MB. Free memory was 170.2MB in the beginning and 168.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 11:01:53,550 INFO L158 Benchmark]: RCFGBuilder took 8944.15ms. Allocated memory is still 196.1MB. Free memory was 168.6MB in the beginning and 155.5MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 11:01:53,550 INFO L158 Benchmark]: TraceAbstraction took 216443.70ms. Allocated memory was 196.1MB in the beginning and 280.0MB in the end (delta: 83.9MB). Free memory was 154.5MB in the beginning and 219.2MB in the end (delta: -64.7MB). Peak memory consumption was 20.2MB. Max. memory is 8.0GB. [2022-04-27 11:01:53,551 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.27ms. Allocated memory is still 196.1MB. Free memory is still 161.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 267.33ms. Allocated memory is still 196.1MB. Free memory was 145.3MB in the beginning and 170.2MB in the end (delta: -24.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.88ms. Allocated memory is still 196.1MB. Free memory was 170.2MB in the beginning and 168.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 8944.15ms. Allocated memory is still 196.1MB. Free memory was 168.6MB in the beginning and 155.5MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 216443.70ms. Allocated memory was 196.1MB in the beginning and 280.0MB in the end (delta: 83.9MB). Free memory was 154.5MB in the beginning and 219.2MB in the end (delta: -64.7MB). Peak memory consumption was 20.2MB. 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: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 216.4s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 197.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 50 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 107.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 291 SdHoareTripleChecker+Invalid, 102.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 187 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 245 IncrementalHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 104 mSDtfsCounter, 245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 17 NumberOfFragments, 181 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 1163 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 7/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 RESULT: Ultimate proved your program to be correct! [2022-04-27 11:01:53,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...