/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/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-u_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 06:06:51,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 06:06:51,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 06:06:51,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 06:06:51,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 06:06:51,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 06:06:51,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 06:06:51,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 06:06:51,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 06:06:51,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 06:06:51,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 06:06:51,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 06:06:51,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 06:06:51,169 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 06:06:51,170 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 06:06:51,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 06:06:51,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 06:06:51,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 06:06:51,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 06:06:51,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 06:06:51,174 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 06:06:51,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 06:06:51,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 06:06:51,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 06:06:51,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 06:06:51,178 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 06:06:51,178 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 06:06:51,178 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 06:06:51,179 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 06:06:51,179 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 06:06:51,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 06:06:51,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 06:06:51,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 06:06:51,180 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 06:06:51,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 06:06:51,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 06:06:51,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 06:06:51,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 06:06:51,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 06:06:51,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 06:06:51,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 06:06:51,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 06:06:51,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 06:06:51,189 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 06:06:51,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 06:06:51,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 06:06:51,190 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 06:06:51,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 06:06:51,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 06:06:51,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 06:06:51,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 06:06:51,190 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 06:06:51,190 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 06:06:51,191 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 06:06:51,191 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 06:06:51,191 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 06:06:51,191 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 06:06:51,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 06:06:51,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 06:06:51,191 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 06:06:51,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 06:06:51,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 06:06:51,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 06:06:51,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 06:06:51,192 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 06:06:51,192 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 06:06:51,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 06:06:51,192 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 06:06:51,192 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 06:06:51,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 06:06:51,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 06:06:51,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 06:06:51,392 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 06:06:51,393 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 06:06:51,394 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-u_unwindbound100.c [2022-04-28 06:06:51,440 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921533067/64b4854235a04033bae11bc651c3777d/FLAG97cb4fc97 [2022-04-28 06:06:51,792 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 06:06:51,792 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-u_unwindbound100.c [2022-04-28 06:06:51,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921533067/64b4854235a04033bae11bc651c3777d/FLAG97cb4fc97 [2022-04-28 06:06:51,806 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921533067/64b4854235a04033bae11bc651c3777d [2022-04-28 06:06:51,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 06:06:51,810 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 06:06:51,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 06:06:51,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 06:06:51,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 06:06:51,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 06:06:51" (1/1) ... [2022-04-28 06:06:51,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@458df014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:06:51, skipping insertion in model container [2022-04-28 06:06:51,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 06:06:51" (1/1) ... [2022-04-28 06:06:51,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 06:06:51,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 06:06:51,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-u_unwindbound100.c[555,568] [2022-04-28 06:06:51,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 06:06:51,971 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 06:06:51,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-u_unwindbound100.c[555,568] [2022-04-28 06:06:51,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 06:06:51,991 INFO L208 MainTranslator]: Completed translation [2022-04-28 06:06:51,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:06:51 WrapperNode [2022-04-28 06:06:51,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 06:06:51,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 06:06:51,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 06:06:51,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 06:06:51,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:06:51" (1/1) ... [2022-04-28 06:06:51,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:06:51" (1/1) ... [2022-04-28 06:06:52,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:06:51" (1/1) ... [2022-04-28 06:06:52,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:06:51" (1/1) ... [2022-04-28 06:06:52,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:06:51" (1/1) ... [2022-04-28 06:06:52,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:06:51" (1/1) ... [2022-04-28 06:06:52,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:06:51" (1/1) ... [2022-04-28 06:06:52,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 06:06:52,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 06:06:52,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 06:06:52,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 06:06:52,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:06:51" (1/1) ... [2022-04-28 06:06:52,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 06:06:52,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:06:52,041 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-28 06:06:52,050 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-28 06:06:52,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 06:06:52,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 06:06:52,071 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 06:06:52,071 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 06:06:52,071 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 06:06:52,071 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 06:06:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 06:06:52,071 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 06:06:52,072 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 06:06:52,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 06:06:52,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 06:06:52,072 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 06:06:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 06:06:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 06:06:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 06:06:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 06:06:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 06:06:52,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 06:06:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 06:06:52,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 06:06:52,121 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 06:06:52,122 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 06:06:52,198 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 06:06:52,203 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 06:06:52,203 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 06:06:52,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 06:06:52 BoogieIcfgContainer [2022-04-28 06:06:52,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 06:06:52,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 06:06:52,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 06:06:52,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 06:06:52,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 06:06:51" (1/3) ... [2022-04-28 06:06:52,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21527d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 06:06:52, skipping insertion in model container [2022-04-28 06:06:52,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:06:51" (2/3) ... [2022-04-28 06:06:52,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21527d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 06:06:52, skipping insertion in model container [2022-04-28 06:06:52,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 06:06:52" (3/3) ... [2022-04-28 06:06:52,214 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-u_unwindbound100.c [2022-04-28 06:06:52,223 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 06:06:52,223 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 06:06:52,282 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 06:06:52,286 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3b758045, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c1cd449 [2022-04-28 06:06:52,286 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 06:06:52,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 06:06:52,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 06:06:52,298 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:06:52,299 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:06:52,299 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:06:52,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:06:52,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1864317590, now seen corresponding path program 1 times [2022-04-28 06:06:52,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:06:52,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [383317572] [2022-04-28 06:06:52,315 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:06:52,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1864317590, now seen corresponding path program 2 times [2022-04-28 06:06:52,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:06:52,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783831974] [2022-04-28 06:06:52,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:06:52,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:06:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:06:52,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 06:06:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:06:52,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID [2022-04-28 06:06:52,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 06:06:52,454 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #55#return; {26#true} is VALID [2022-04-28 06:06:52,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 06:06:52,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID [2022-04-28 06:06:52,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 06:06:52,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #55#return; {26#true} is VALID [2022-04-28 06:06:52,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret7 := main(); {26#true} is VALID [2022-04-28 06:06:52,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;~z~0 := #t~nondet4;havoc #t~nondet4;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := ~z~0 % 4294967296;~c~0 := 1; {26#true} is VALID [2022-04-28 06:06:52,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-28 06:06:52,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} ~x~0 := ~x~0 * ((~z~0 - 1) % 4294967296); {27#false} is VALID [2022-04-28 06:06:52,457 INFO L272 TraceCheckUtils]: 8: Hoare triple {27#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {27#false} is VALID [2022-04-28 06:06:52,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-28 06:06:52,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-28 06:06:52,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-28 06:06:52,458 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-28 06:06:52,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:06:52,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783831974] [2022-04-28 06:06:52,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783831974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:06:52,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:06:52,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 06:06:52,473 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:06:52,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [383317572] [2022-04-28 06:06:52,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [383317572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:06:52,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:06:52,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 06:06:52,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511589158] [2022-04-28 06:06:52,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:06:52,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 06:06:52,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:06:52,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:06:52,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:52,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 06:06:52,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:06:52,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 06:06:52,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 06:06:52,527 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:06:52,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:52,605 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-04-28 06:06:52,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 06:06:52,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 06:06:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:06:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:06:52,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-28 06:06:52,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:06:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-28 06:06:52,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2022-04-28 06:06:52,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:52,687 INFO L225 Difference]: With dead ends: 41 [2022-04-28 06:06:52,687 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 06:06:52,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 06:06:52,693 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:06:52,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:06:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 06:06:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-28 06:06:52,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:06:52,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:06:52,718 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:06:52,718 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:06:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:52,722 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 06:06:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 06:06:52,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:06:52,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:06:52,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-28 06:06:52,723 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-28 06:06:52,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:52,725 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 06:06:52,725 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 06:06:52,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:06:52,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:06:52,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:06:52,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:06:52,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:06:52,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-28 06:06:52,728 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-28 06:06:52,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:06:52,728 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-28 06:06:52,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:06:52,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-28 06:06:52,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 06:06:52,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 06:06:52,754 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:06:52,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:06:52,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 06:06:52,755 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:06:52,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:06:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2049175951, now seen corresponding path program 1 times [2022-04-28 06:06:52,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:06:52,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [138970018] [2022-04-28 06:06:52,757 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:06:52,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2049175951, now seen corresponding path program 2 times [2022-04-28 06:06:52,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:06:52,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533022541] [2022-04-28 06:06:52,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:06:52,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:06:52,769 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:06:52,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1871480271] [2022-04-28 06:06:52,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:06:52,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:06:52,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:06:52,776 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:06:52,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 06:06:52,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 06:06:52,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:06:52,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 06:06:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:06:52,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:06:52,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2022-04-28 06:06:52,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {190#true} is VALID [2022-04-28 06:06:52,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {190#true} assume true; {190#true} is VALID [2022-04-28 06:06:52,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190#true} {190#true} #55#return; {190#true} is VALID [2022-04-28 06:06:52,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {190#true} call #t~ret7 := main(); {190#true} is VALID [2022-04-28 06:06:52,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {190#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;~z~0 := #t~nondet4;havoc #t~nondet4;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := ~z~0 % 4294967296;~c~0 := 1; {210#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 06:06:52,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {210#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {210#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 06:06:52,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {210#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {210#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 06:06:52,996 INFO L272 TraceCheckUtils]: 8: Hoare triple {210#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + (~x~0 * (~z~0 % 4294967296) - ~x~0 - ~y~0) then 1 else 0)); {220#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:06:52,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {220#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {224#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:06:52,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {224#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {191#false} is VALID [2022-04-28 06:06:52,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-04-28 06:06:52,997 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-28 06:06:52,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:06:52,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:06:52,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533022541] [2022-04-28 06:06:52,998 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:06:52,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871480271] [2022-04-28 06:06:52,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871480271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:06:52,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:06:52,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:06:53,000 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:06:53,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [138970018] [2022-04-28 06:06:53,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [138970018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:06:53,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:06:53,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:06:53,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412027356] [2022-04-28 06:06:53,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:06:53,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 06:06:53,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:06:53,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:06:53,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:53,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:06:53,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:06:53,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:06:53,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 06:06:53,024 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:06:53,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:53,125 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 06:06:53,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 06:06:53,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 06:06:53,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:06:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:06:53,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-28 06:06:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:06:53,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-28 06:06:53,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-04-28 06:06:53,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:53,164 INFO L225 Difference]: With dead ends: 29 [2022-04-28 06:06:53,164 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 06:06:53,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-28 06:06:53,166 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:06:53,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 58 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:06:53,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 06:06:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-28 06:06:53,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:06:53,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:06:53,184 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:06:53,184 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:06:53,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:53,187 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 06:06:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 06:06:53,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:06:53,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:06:53,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-28 06:06:53,188 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-28 06:06:53,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:53,190 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 06:06:53,190 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 06:06:53,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:06:53,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:06:53,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:06:53,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:06:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:06:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-28 06:06:53,192 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 12 [2022-04-28 06:06:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:06:53,192 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-28 06:06:53,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:06:53,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-28 06:06:53,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 06:06:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 06:06:53,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:06:53,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:06:53,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 06:06:53,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:06:53,424 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:06:53,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:06:53,424 INFO L85 PathProgramCache]: Analyzing trace with hash -975399299, now seen corresponding path program 1 times [2022-04-28 06:06:53,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:06:53,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [596104207] [2022-04-28 06:06:53,425 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:06:53,425 INFO L85 PathProgramCache]: Analyzing trace with hash -975399299, now seen corresponding path program 2 times [2022-04-28 06:06:53,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:06:53,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994251400] [2022-04-28 06:06:53,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:06:53,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:06:53,435 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:06:53,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1622167901] [2022-04-28 06:06:53,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:06:53,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:06:53,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:06:53,437 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:06:53,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 06:06:53,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 06:06:53,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:06:53,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 06:06:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:06:53,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:06:53,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {394#true} call ULTIMATE.init(); {394#true} is VALID [2022-04-28 06:06:53,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {402#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:53,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {402#(<= ~counter~0 0)} assume true; {402#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:53,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {402#(<= ~counter~0 0)} {394#true} #55#return; {402#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:53,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {402#(<= ~counter~0 0)} call #t~ret7 := main(); {402#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:53,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {402#(<= ~counter~0 0)} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;~z~0 := #t~nondet4;havoc #t~nondet4;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := ~z~0 % 4294967296;~c~0 := 1; {402#(<= ~counter~0 0)} is VALID [2022-04-28 06:06:53,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {402#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {418#(<= |main_#t~post6| 0)} is VALID [2022-04-28 06:06:53,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {395#false} is VALID [2022-04-28 06:06:53,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {395#false} ~x~0 := ~x~0 * ((~z~0 - 1) % 4294967296); {395#false} is VALID [2022-04-28 06:06:53,572 INFO L272 TraceCheckUtils]: 9: Hoare triple {395#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {395#false} is VALID [2022-04-28 06:06:53,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {395#false} ~cond := #in~cond; {395#false} is VALID [2022-04-28 06:06:53,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {395#false} assume 0 == ~cond; {395#false} is VALID [2022-04-28 06:06:53,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {395#false} assume !false; {395#false} is VALID [2022-04-28 06:06:53,573 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-28 06:06:53,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:06:53,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:06:53,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994251400] [2022-04-28 06:06:53,574 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:06:53,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622167901] [2022-04-28 06:06:53,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622167901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:06:53,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:06:53,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 06:06:53,575 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:06:53,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [596104207] [2022-04-28 06:06:53,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [596104207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:06:53,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:06:53,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 06:06:53,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402528697] [2022-04-28 06:06:53,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:06:53,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 06:06:53,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:06:53,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:06:53,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:53,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 06:06:53,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:06:53,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 06:06:53,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 06:06:53,587 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:06:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:53,627 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 06:06:53,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 06:06:53,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 06:06:53,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:06:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:06:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-28 06:06:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:06:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-28 06:06:53,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-28 06:06:53,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:53,666 INFO L225 Difference]: With dead ends: 33 [2022-04-28 06:06:53,666 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 06:06:53,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 06:06:53,667 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:06:53,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:06:53,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 06:06:53,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 06:06:53,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:06:53,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:06:53,678 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:06:53,678 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:06:53,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:53,679 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 06:06:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 06:06:53,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:06:53,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:06:53,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-28 06:06:53,680 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-28 06:06:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:06:53,681 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 06:06:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 06:06:53,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:06:53,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:06:53,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:06:53,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:06:53,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:06:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-28 06:06:53,683 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2022-04-28 06:06:53,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:06:53,683 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-28 06:06:53,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:06:53,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-28 06:06:53,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:06:53,711 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 06:06:53,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 06:06:53,711 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:06:53,711 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:06:53,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 06:06:53,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 06:06:53,925 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:06:53,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:06:53,925 INFO L85 PathProgramCache]: Analyzing trace with hash 198190047, now seen corresponding path program 1 times [2022-04-28 06:06:53,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:06:53,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1659880098] [2022-04-28 06:06:53,926 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:06:53,926 INFO L85 PathProgramCache]: Analyzing trace with hash 198190047, now seen corresponding path program 2 times [2022-04-28 06:06:53,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:06:53,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796786867] [2022-04-28 06:06:53,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:06:53,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:06:53,936 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:06:53,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1023699682] [2022-04-28 06:06:53,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:06:53,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:06:53,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:06:53,937 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:06:53,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 06:06:53,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:06:53,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 06:06:53,973 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 06:06:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 06:06:53,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 06:06:53,990 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 06:06:53,990 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 06:06:53,991 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 06:06:54,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 06:06:54,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:06:54,210 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2] [2022-04-28 06:06:54,212 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 06:06:54,218 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 06:06:54,218 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 06:06:54,218 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 06:06:54,218 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-28 06:06:54,219 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-28 06:06:54,220 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-28 06:06:54,220 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-28 06:06:54,220 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-28 06:06:54,220 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-28 06:06:54,220 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 06:06:54,220 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 06:06:54,220 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-28 06:06:54,220 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 06:06:54,220 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 06:06:54,220 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 06:06:54,220 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 06:06:54,220 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 06:06:54,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 06:06:54 BoogieIcfgContainer [2022-04-28 06:06:54,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 06:06:54,221 INFO L158 Benchmark]: Toolchain (without parser) took 2411.06ms. Allocated memory was 227.5MB in the beginning and 284.2MB in the end (delta: 56.6MB). Free memory was 179.1MB in the beginning and 199.7MB in the end (delta: -20.6MB). Peak memory consumption was 37.0MB. Max. memory is 8.0GB. [2022-04-28 06:06:54,222 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 227.5MB. Free memory was 195.3MB in the beginning and 195.2MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 06:06:54,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.05ms. Allocated memory is still 227.5MB. Free memory was 178.8MB in the beginning and 203.3MB in the end (delta: -24.5MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-28 06:06:54,222 INFO L158 Benchmark]: Boogie Preprocessor took 23.91ms. Allocated memory is still 227.5MB. Free memory was 203.3MB in the beginning and 201.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 06:06:54,222 INFO L158 Benchmark]: RCFGBuilder took 188.07ms. Allocated memory is still 227.5MB. Free memory was 201.8MB in the beginning and 191.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 06:06:54,223 INFO L158 Benchmark]: TraceAbstraction took 2010.47ms. Allocated memory was 227.5MB in the beginning and 284.2MB in the end (delta: 56.6MB). Free memory was 190.9MB in the beginning and 199.7MB in the end (delta: -8.7MB). Peak memory consumption was 47.7MB. Max. memory is 8.0GB. [2022-04-28 06:06:54,223 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.09ms. Allocated memory is still 227.5MB. Free memory was 195.3MB in the beginning and 195.2MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.05ms. Allocated memory is still 227.5MB. Free memory was 178.8MB in the beginning and 203.3MB in the end (delta: -24.5MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.91ms. Allocated memory is still 227.5MB. Free memory was 203.3MB in the beginning and 201.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 188.07ms. Allocated memory is still 227.5MB. Free memory was 201.8MB in the beginning and 191.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2010.47ms. Allocated memory was 227.5MB in the beginning and 284.2MB in the end (delta: 56.6MB). Free memory was 190.9MB in the beginning and 199.7MB in the end (delta: -8.7MB). Peak memory consumption was 47.7MB. 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] unsigned int z, k; [L25] long long x, y, c; [L26] z = __VERIFIER_nondet_uint() [L27] k = __VERIFIER_nondet_uint() [L29] x = 1 [L30] y = z [L31] c = 1 [L33] EXPR counter++ [L33] COND TRUE counter++<100 [L34] CALL __VERIFIER_assert(x*z - x - y + 1 == 0) [L16] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert(x*z - x - y + 1 == 0) [L36] COND TRUE !(c < k) [L45] x = x * (z - 1) [L47] CALL __VERIFIER_assert(1 + x - y == 0) [L16] COND TRUE !(cond) [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 58 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=2, InterpolantAutomatonStates: 12, 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, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-28 06:06:54,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...