/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-u_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:21:04,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:21:04,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:21:04,056 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:21:04,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:21:04,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:21:04,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:21:04,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:21:04,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:21:04,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:21:04,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:21:04,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:21:04,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:21:04,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:21:04,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:21:04,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:21:04,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:21:04,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:21:04,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:21:04,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:21:04,090 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:21:04,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:21:04,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:21:04,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:21:04,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:21:04,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:21:04,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:21:04,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:21:04,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:21:04,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:21:04,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:21:04,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:21:04,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:21:04,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:21:04,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:21:04,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:21:04,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:21:04,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:21:04,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:21:04,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:21:04,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:21:04,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:21:04,107 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:21:04,133 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:21:04,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:21:04,134 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:21:04,134 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:21:04,134 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:21:04,134 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:21:04,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:21:04,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:21:04,135 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:21:04,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:21:04,136 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:21:04,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:21:04,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:21:04,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:21:04,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:21:04,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:21:04,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:21:04,137 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:21:04,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:21:04,137 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:21:04,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:21:04,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:21:04,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:21:04,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:21:04,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:21:04,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:21:04,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:21:04,138 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:21:04,138 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:21:04,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:21:04,138 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:21:04,138 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:21:04,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:21:04,139 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 13:21:04,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:21:04,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:21:04,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:21:04,311 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:21:04,312 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:21:04,313 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-u_unwindbound2.c [2022-04-27 13:21:04,350 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/755bae878/5067cfddd2384484b3e09af676d46e4d/FLAGe595109fc [2022-04-27 13:21:04,646 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:21:04,647 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-u_unwindbound2.c [2022-04-27 13:21:04,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/755bae878/5067cfddd2384484b3e09af676d46e4d/FLAGe595109fc [2022-04-27 13:21:05,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/755bae878/5067cfddd2384484b3e09af676d46e4d [2022-04-27 13:21:05,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:21:05,100 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:21:05,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:21:05,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:21:05,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:21:05,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:21:05" (1/1) ... [2022-04-27 13:21:05,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3201359e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:05, skipping insertion in model container [2022-04-27 13:21:05,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:21:05" (1/1) ... [2022-04-27 13:21:05,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:21:05,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:21:05,246 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_unwindbound2.c[555,568] [2022-04-27 13:21:05,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:21:05,263 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:21:05,271 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_unwindbound2.c[555,568] [2022-04-27 13:21:05,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:21:05,287 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:21:05,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:05 WrapperNode [2022-04-27 13:21:05,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:21:05,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:21:05,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:21:05,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:21:05,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:05" (1/1) ... [2022-04-27 13:21:05,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:05" (1/1) ... [2022-04-27 13:21:05,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:05" (1/1) ... [2022-04-27 13:21:05,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:05" (1/1) ... [2022-04-27 13:21:05,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:05" (1/1) ... [2022-04-27 13:21:05,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:05" (1/1) ... [2022-04-27 13:21:05,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:05" (1/1) ... [2022-04-27 13:21:05,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:21:05,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:21:05,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:21:05,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:21:05,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:05" (1/1) ... [2022-04-27 13:21:05,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:21:05,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:05,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 13:21:05,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 13:21:05,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:21:05,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:21:05,365 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:21:05,365 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:21:05,365 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:21:05,365 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:21:05,365 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:21:05,366 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:21:05,366 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:21:05,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:21:05,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 13:21:05,366 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:21:05,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:21:05,366 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:21:05,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:21:05,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:21:05,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:21:05,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:21:05,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:21:05,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:21:05,410 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:21:05,411 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:21:05,533 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:21:05,539 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:21:05,539 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 13:21:05,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:21:05 BoogieIcfgContainer [2022-04-27 13:21:05,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:21:05,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:21:05,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:21:05,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:21:05,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:21:05" (1/3) ... [2022-04-27 13:21:05,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782c899d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:21:05, skipping insertion in model container [2022-04-27 13:21:05,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:05" (2/3) ... [2022-04-27 13:21:05,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782c899d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:21:05, skipping insertion in model container [2022-04-27 13:21:05,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:21:05" (3/3) ... [2022-04-27 13:21:05,560 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-u_unwindbound2.c [2022-04-27 13:21:05,571 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:21:05,572 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:21:05,602 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:21:05,607 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@192feb81, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1a88ebfe [2022-04-27 13:21:05,607 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:21:05,612 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-27 13:21:05,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 13:21:05,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:05,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:05,617 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:05,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:05,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1864317590, now seen corresponding path program 1 times [2022-04-27 13:21:05,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:05,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566825076] [2022-04-27 13:21:05,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:05,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:05,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:21:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:05,737 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-27 13:21:05,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 13:21:05,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #55#return; {26#true} is VALID [2022-04-27 13:21:05,744 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-27 13:21:05,744 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-27 13:21:05,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 13:21:05,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #55#return; {26#true} is VALID [2022-04-27 13:21:05,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret7 := main(); {26#true} is VALID [2022-04-27 13:21:05,745 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-27 13:21:05,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-27 13:21:05,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} ~x~0 := ~x~0 * ((~z~0 - 1) % 4294967296); {27#false} is VALID [2022-04-27 13:21:05,746 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-27 13:21:05,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-27 13:21:05,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-27 13:21:05,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-27 13:21:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:21:05,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:05,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566825076] [2022-04-27 13:21:05,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566825076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:21:05,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:21:05,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:21:05,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930972944] [2022-04-27 13:21:05,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:05,752 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-27 13:21:05,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:05,755 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-27 13:21:05,788 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-27 13:21:05,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:21:05,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:05,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:21:05,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:21:05,811 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-27 13:21:05,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:05,922 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-04-27 13:21:05,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:21:05,923 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-27 13:21:05,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:05,924 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-27 13:21:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-27 13:21:05,935 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-27 13:21:05,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-27 13:21:05,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2022-04-27 13:21:05,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:06,009 INFO L225 Difference]: With dead ends: 41 [2022-04-27 13:21:06,009 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 13:21:06,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:21:06,014 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-27 13:21:06,016 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-27 13:21:06,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 13:21:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-27 13:21:06,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:06,041 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-27 13:21:06,041 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-27 13:21:06,042 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-27 13:21:06,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:06,046 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 13:21:06,046 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 13:21:06,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:06,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:06,047 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-27 13:21:06,047 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-27 13:21:06,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:06,054 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 13:21:06,054 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 13:21:06,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:06,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:06,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:06,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:06,056 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-27 13:21:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-27 13:21:06,059 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-27 13:21:06,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:06,059 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-27 13:21:06,061 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-27 13:21:06,062 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 13:21:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 13:21:06,065 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:06,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:06,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:21:06,067 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:06,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:06,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2049175951, now seen corresponding path program 1 times [2022-04-27 13:21:06,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:06,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497174029] [2022-04-27 13:21:06,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:06,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:06,087 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:06,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2085905097] [2022-04-27 13:21:06,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:06,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:06,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:06,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:21:06,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 13:21:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:06,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:21:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:06,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:21:06,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {152#true} call ULTIMATE.init(); {152#true} is VALID [2022-04-27 13:21:06,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#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; {152#true} is VALID [2022-04-27 13:21:06,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} assume true; {152#true} is VALID [2022-04-27 13:21:06,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#true} {152#true} #55#return; {152#true} is VALID [2022-04-27 13:21:06,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {152#true} call #t~ret7 := main(); {152#true} is VALID [2022-04-27 13:21:06,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#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; {172#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-27 13:21:06,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {172#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {172#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-27 13:21:06,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {172#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-27 13:21:06,246 INFO L272 TraceCheckUtils]: 8: Hoare triple {172#(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)); {182#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:21:06,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:06,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {153#false} is VALID [2022-04-27 13:21:06,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-04-27 13:21:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:21:06,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:21:06,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:06,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497174029] [2022-04-27 13:21:06,249 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:21:06,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085905097] [2022-04-27 13:21:06,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085905097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:21:06,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:21:06,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:21:06,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437332666] [2022-04-27 13:21:06,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:06,251 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-27 13:21:06,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:06,251 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-27 13:21:06,260 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-27 13:21:06,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:21:06,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:06,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:21:06,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:21:06,262 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-27 13:21:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:06,352 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-27 13:21:06,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:21:06,352 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-27 13:21:06,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:06,353 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-27 13:21:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-27 13:21:06,355 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-27 13:21:06,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-27 13:21:06,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-04-27 13:21:06,381 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-27 13:21:06,383 INFO L225 Difference]: With dead ends: 29 [2022-04-27 13:21:06,383 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 13:21:06,384 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-27 13:21:06,385 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-27 13:21:06,386 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-27 13:21:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 13:21:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-27 13:21:06,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:06,394 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-27 13:21:06,395 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-27 13:21:06,396 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-27 13:21:06,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:06,398 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 13:21:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 13:21:06,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:06,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:06,400 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-27 13:21:06,400 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-27 13:21:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:06,403 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 13:21:06,403 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 13:21:06,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:06,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:06,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:06,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:06,404 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-27 13:21:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-27 13:21:06,409 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 12 [2022-04-27 13:21:06,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:06,409 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-27 13:21:06,409 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-27 13:21:06,409 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 13:21:06,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 13:21:06,410 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:06,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:06,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:21:06,625 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-27 13:21:06,626 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:06,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:06,626 INFO L85 PathProgramCache]: Analyzing trace with hash -975399299, now seen corresponding path program 1 times [2022-04-27 13:21:06,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:06,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764548576] [2022-04-27 13:21:06,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:06,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:06,641 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:06,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [788575365] [2022-04-27 13:21:06,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:06,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:06,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:06,643 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-27 13:21:06,644 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-27 13:21:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:06,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:21:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:06,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:21:06,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {324#true} call ULTIMATE.init(); {324#true} is VALID [2022-04-27 13:21:06,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {324#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; {332#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:06,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {332#(<= ~counter~0 0)} assume true; {332#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:06,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {332#(<= ~counter~0 0)} {324#true} #55#return; {332#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:06,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {332#(<= ~counter~0 0)} call #t~ret7 := main(); {332#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:06,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {332#(<= ~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; {332#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:06,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {332#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {348#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:21:06,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {348#(<= |main_#t~post6| 0)} assume !(#t~post6 < 2);havoc #t~post6; {325#false} is VALID [2022-04-27 13:21:06,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {325#false} ~x~0 := ~x~0 * ((~z~0 - 1) % 4294967296); {325#false} is VALID [2022-04-27 13:21:06,777 INFO L272 TraceCheckUtils]: 9: Hoare triple {325#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {325#false} is VALID [2022-04-27 13:21:06,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {325#false} ~cond := #in~cond; {325#false} is VALID [2022-04-27 13:21:06,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {325#false} assume 0 == ~cond; {325#false} is VALID [2022-04-27 13:21:06,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {325#false} assume !false; {325#false} is VALID [2022-04-27 13:21:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:21:06,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:21:06,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:06,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764548576] [2022-04-27 13:21:06,782 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:21:06,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788575365] [2022-04-27 13:21:06,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788575365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:21:06,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:21:06,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:21:06,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156100103] [2022-04-27 13:21:06,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:06,784 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-27 13:21:06,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:06,785 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-27 13:21:06,818 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-27 13:21:06,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:21:06,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:06,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:21:06,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:21:06,821 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-27 13:21:06,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:06,856 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-27 13:21:06,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:21:06,856 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-27 13:21:06,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:06,857 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-27 13:21:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-27 13:21:06,858 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-27 13:21:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-27 13:21:06,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-27 13:21:06,878 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-27 13:21:06,879 INFO L225 Difference]: With dead ends: 33 [2022-04-27 13:21:06,879 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 13:21:06,880 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-27 13:21:06,880 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-27 13:21:06,881 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-27 13:21:06,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 13:21:06,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 13:21:06,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:06,887 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-27 13:21:06,887 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-27 13:21:06,887 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-27 13:21:06,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:06,888 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 13:21:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 13:21:06,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:06,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:06,889 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-27 13:21:06,889 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-27 13:21:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:06,890 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 13:21:06,890 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 13:21:06,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:06,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:06,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:06,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:06,891 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-27 13:21:06,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-27 13:21:06,892 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2022-04-27 13:21:06,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:06,892 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-27 13:21:06,892 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-27 13:21:06,892 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 13:21:06,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 13:21:06,893 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:06,893 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-27 13:21:06,927 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-27 13:21:07,107 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-27 13:21:07,108 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:07,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:07,108 INFO L85 PathProgramCache]: Analyzing trace with hash 198190047, now seen corresponding path program 1 times [2022-04-27 13:21:07,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:07,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187526205] [2022-04-27 13:21:07,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:07,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:07,119 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:07,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [557076991] [2022-04-27 13:21:07,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:07,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:07,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:07,120 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-27 13:21:07,121 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-27 13:21:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:21:07,158 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 13:21:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:21:07,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 13:21:07,189 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 13:21:07,190 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:21:07,208 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-27 13:21:07,408 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-27 13:21:07,410 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 13:21:07,413 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:21:07,429 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:21:07,429 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 13:21:07,429 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:21:07,429 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:21:07,429 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 13:21:07,429 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 13:21:07,429 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 13:21:07,429 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:21:07,429 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 13:21:07,430 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 13:21:07,431 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:21:07,431 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:21:07,431 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-27 13:21:07,431 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:21:07,431 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:21:07,431 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:21:07,431 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:21:07,431 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-27 13:21:07,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:21:07 BoogieIcfgContainer [2022-04-27 13:21:07,431 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:21:07,432 INFO L158 Benchmark]: Toolchain (without parser) took 2332.57ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 117.5MB in the beginning and 166.1MB in the end (delta: -48.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:21:07,433 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 167.8MB. Free memory was 133.6MB in the beginning and 133.5MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:21:07,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.76ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 143.6MB in the end (delta: -26.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 13:21:07,433 INFO L158 Benchmark]: Boogie Preprocessor took 17.34ms. Allocated memory is still 167.8MB. Free memory was 143.6MB in the beginning and 142.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 13:21:07,433 INFO L158 Benchmark]: RCFGBuilder took 234.79ms. Allocated memory is still 167.8MB. Free memory was 142.0MB in the beginning and 131.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 13:21:07,434 INFO L158 Benchmark]: TraceAbstraction took 1877.08ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 130.5MB in the beginning and 166.1MB in the end (delta: -35.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-04-27 13:21:07,435 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 167.8MB. Free memory was 133.6MB in the beginning and 133.5MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.76ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 143.6MB in the end (delta: -26.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.34ms. Allocated memory is still 167.8MB. Free memory was 143.6MB in the beginning and 142.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 234.79ms. Allocated memory is still 167.8MB. Free memory was 142.0MB in the beginning and 131.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1877.08ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 130.5MB in the beginning and 166.1MB in the end (delta: -35.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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; VAL [\old(counter)=4, 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 VAL [\old(counter)=0, c=1, counter=0, k=0, x=1, y=0, z=0] [L33] EXPR counter++ VAL [\old(counter)=0, c=1, counter=1, counter++=0, k=0, x=1, y=0, z=0] [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [\old(counter)=0, c=1, counter=1, k=0, x=1, y=0, z=0] [L36] COND TRUE !(c < k) VAL [\old(counter)=0, c=1, counter=1, k=0, x=1, y=0, z=0] [L45] x = x * (z - 1) VAL [\old(counter)=0, c=1, counter=1, k=0, x=4294967295, y=0, z=0] [L47] CALL __VERIFIER_assert(1 + x - y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=1] [L16] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=1] [L18] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, 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: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 83 SizeOfPredicates, 2 NumberOfNonLiveVariables, 144 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 13:21:07,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...