/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/geo2-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:21:21,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:21:21,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:21:21,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:21:21,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:21:21,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:21:21,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:21:21,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:21:21,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:21:21,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:21:21,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:21:21,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:21:21,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:21:21,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:21:21,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:21:21,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:21:21,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:21:21,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:21:21,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:21:21,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:21:21,315 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:21:21,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:21:21,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:21:21,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:21:21,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:21:21,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:21:21,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:21:21,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:21:21,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:21:21,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:21:21,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:21:21,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:21:21,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:21:21,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:21:21,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:21:21,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:21:21,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:21:21,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:21:21,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:21:21,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:21:21,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:21:21,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:21:21,333 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:21,351 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:21:21,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:21:21,354 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:21:21,354 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:21:21,354 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:21:21,354 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:21:21,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:21:21,355 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:21:21,355 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:21:21,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:21:21,355 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:21:21,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:21:21,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:21:21,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:21:21,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:21:21,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:21:21,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:21:21,356 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:21:21,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:21:21,357 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:21:21,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:21:21,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:21:21,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:21:21,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:21:21,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:21:21,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:21:21,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:21:21,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:21:21,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:21:21,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:21:21,358 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:21:21,358 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:21:21,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:21:21,358 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:21,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:21:21,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:21:21,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:21:21,547 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:21:21,547 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:21:21,548 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_unwindbound50.c [2022-04-27 13:21:21,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d30a1d85d/75af7cbe70e544e7aa34c619f0d3c04d/FLAGcc68f3fdc [2022-04-27 13:21:21,967 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:21:21,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_unwindbound50.c [2022-04-27 13:21:21,977 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d30a1d85d/75af7cbe70e544e7aa34c619f0d3c04d/FLAGcc68f3fdc [2022-04-27 13:21:21,988 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d30a1d85d/75af7cbe70e544e7aa34c619f0d3c04d [2022-04-27 13:21:21,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:21:21,992 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:21:21,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:21:21,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:21:21,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:21:22,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:21:21" (1/1) ... [2022-04-27 13:21:22,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40a50d96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:22, skipping insertion in model container [2022-04-27 13:21:22,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:21:21" (1/1) ... [2022-04-27 13:21:22,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:21:22,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:21:22,123 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/geo2-ll_unwindbound50.c[525,538] [2022-04-27 13:21:22,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:21:22,149 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:21:22,176 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/geo2-ll_unwindbound50.c[525,538] [2022-04-27 13:21:22,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:21:22,195 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:21:22,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:22 WrapperNode [2022-04-27 13:21:22,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:21:22,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:21:22,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:21:22,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:21:22,203 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:22" (1/1) ... [2022-04-27 13:21:22,203 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:22" (1/1) ... [2022-04-27 13:21:22,209 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:22" (1/1) ... [2022-04-27 13:21:22,209 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:22" (1/1) ... [2022-04-27 13:21:22,220 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:22" (1/1) ... [2022-04-27 13:21:22,224 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:22" (1/1) ... [2022-04-27 13:21:22,225 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:22" (1/1) ... [2022-04-27 13:21:22,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:21:22,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:21:22,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:21:22,231 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:21:22,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:22" (1/1) ... [2022-04-27 13:21:22,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:21:22,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:22,256 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:22,276 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:22,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:21:22,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:21:22,286 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:21:22,286 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:21:22,288 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:21:22,288 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:21:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:21:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:21:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:21:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:21:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:21:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:21:22,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:21:22,289 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:21:22,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:21:22,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:21:22,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:21:22,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:21:22,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:21:22,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:21:22,340 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:21:22,342 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:21:22,467 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:21:22,472 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:21:22,472 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 13:21:22,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:21:22 BoogieIcfgContainer [2022-04-27 13:21:22,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:21:22,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:21:22,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:21:22,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:21:22,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:21:21" (1/3) ... [2022-04-27 13:21:22,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f59da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:21:22, skipping insertion in model container [2022-04-27 13:21:22,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:22" (2/3) ... [2022-04-27 13:21:22,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f59da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:21:22, skipping insertion in model container [2022-04-27 13:21:22,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:21:22" (3/3) ... [2022-04-27 13:21:22,478 INFO L111 eAbstractionObserver]: Analyzing ICFG geo2-ll_unwindbound50.c [2022-04-27 13:21:22,488 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:21:22,488 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:21:22,539 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:21:22,544 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@5cfed354, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b1e0726 [2022-04-27 13:21:22,544 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:21:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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:22,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 13:21:22,563 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:22,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:22,564 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:22,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:22,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times [2022-04-27 13:21:22,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:22,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556815311] [2022-04-27 13:21:22,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:22,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:22,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:21:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:22,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-27 13:21:22,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 13:21:22,750 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-27 13:21:22,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:21:22,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-27 13:21:22,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 13:21:22,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-27 13:21:22,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret7 := main(); {25#true} is VALID [2022-04-27 13:21:22,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {25#true} is VALID [2022-04-27 13:21:22,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-27 13:21:22,754 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {26#false} is VALID [2022-04-27 13:21:22,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-27 13:21:22,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-27 13:21:22,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-27 13:21:22,755 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:22,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:22,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556815311] [2022-04-27 13:21:22,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556815311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:21:22,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:21:22,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:21:22,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283385874] [2022-04-27 13:21:22,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:22,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 13:21:22,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:22,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:22,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:22,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:21:22,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:22,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:21:22,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:21:22,804 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:22,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:22,898 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-27 13:21:22,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:21:22,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 13:21:22,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:22,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:22,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-27 13:21:22,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:22,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-27 13:21:22,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-27 13:21:22,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:22,970 INFO L225 Difference]: With dead ends: 39 [2022-04-27 13:21:22,970 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 13:21:22,973 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:22,976 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:21:22,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:21:22,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 13:21:22,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-27 13:21:22,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:22,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 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:22,999 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 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:22,999 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 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:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:23,004 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 13:21:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 13:21:23,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:23,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:23,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 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 18 states. [2022-04-27 13:21:23,005 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 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 18 states. [2022-04-27 13:21:23,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:23,007 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 13:21:23,007 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 13:21:23,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:23,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:23,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:23,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 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:23,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 13:21:23,010 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-27 13:21:23,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:23,011 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 13:21:23,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:21:23,011 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 13:21:23,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 13:21:23,012 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:23,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:23,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:21:23,012 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:23,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:23,013 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times [2022-04-27 13:21:23,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:23,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876089512] [2022-04-27 13:21:23,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:23,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:23,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:23,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1690410363] [2022-04-27 13:21:23,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:23,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:23,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:23,033 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:23,035 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:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:23,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:21:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:23,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:21:23,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {146#true} call ULTIMATE.init(); {146#true} is VALID [2022-04-27 13:21:23,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {154#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:23,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#(<= ~counter~0 0)} assume true; {154#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:23,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#(<= ~counter~0 0)} {146#true} #54#return; {154#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:23,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#(<= ~counter~0 0)} call #t~ret7 := main(); {154#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:23,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#(<= ~counter~0 0)} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {154#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:23,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:21:23,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {170#(<= |main_#t~post6| 0)} assume !(#t~post6 < 50);havoc #t~post6; {147#false} is VALID [2022-04-27 13:21:23,261 INFO L272 TraceCheckUtils]: 8: Hoare triple {147#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {147#false} is VALID [2022-04-27 13:21:23,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {147#false} ~cond := #in~cond; {147#false} is VALID [2022-04-27 13:21:23,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {147#false} assume 0 == ~cond; {147#false} is VALID [2022-04-27 13:21:23,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {147#false} assume !false; {147#false} is VALID [2022-04-27 13:21:23,262 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:23,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:21:23,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:23,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876089512] [2022-04-27 13:21:23,263 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:21:23,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690410363] [2022-04-27 13:21:23,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690410363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:21:23,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:21:23,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:21:23,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201792072] [2022-04-27 13:21:23,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:23,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-27 13:21:23,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:23,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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:23,275 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:23,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:21:23,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:23,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:21:23,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:21:23,277 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:23,339 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-27 13:21:23,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:21:23,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-27 13:21:23,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:23,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-27 13:21:23,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-27 13:21:23,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-27 13:21:23,374 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-27 13:21:23,375 INFO L225 Difference]: With dead ends: 26 [2022-04-27 13:21:23,375 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 13:21:23,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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:23,377 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 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:23,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 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:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 13:21:23,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-27 13:21:23,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:23,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 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:23,387 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 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:23,387 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 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:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:23,388 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 13:21:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 13:21:23,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:23,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:23,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 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:23,389 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 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:23,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:23,391 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 13:21:23,391 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 13:21:23,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:23,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:23,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:23,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:23,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 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:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-27 13:21:23,393 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-27 13:21:23,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:23,394 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-27 13:21:23,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 13:21:23,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 13:21:23,394 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:23,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:23,417 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:23,607 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:23,608 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:23,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:23,609 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times [2022-04-27 13:21:23,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:23,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339254020] [2022-04-27 13:21:23,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:23,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:23,626 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:23,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1838126301] [2022-04-27 13:21:23,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:23,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:23,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:23,632 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:23,639 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:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:23,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:21:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:23,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:21:23,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {288#true} call ULTIMATE.init(); {288#true} is VALID [2022-04-27 13:21:23,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {288#true} is VALID [2022-04-27 13:21:23,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {288#true} assume true; {288#true} is VALID [2022-04-27 13:21:23,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {288#true} {288#true} #54#return; {288#true} is VALID [2022-04-27 13:21:23,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {288#true} call #t~ret7 := main(); {288#true} is VALID [2022-04-27 13:21:23,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {288#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {308#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-27 13:21:23,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {308#(and (= main_~y~0 1) (= main_~x~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {308#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-27 13:21:23,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {308#(and (= main_~y~0 1) (= main_~x~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {308#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-27 13:21:23,835 INFO L272 TraceCheckUtils]: 8: Hoare triple {308#(and (= main_~y~0 1) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:21:23,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:23,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {289#false} is VALID [2022-04-27 13:21:23,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {289#false} assume !false; {289#false} is VALID [2022-04-27 13:21:23,844 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:23,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:21:23,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:23,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339254020] [2022-04-27 13:21:23,848 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:21:23,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838126301] [2022-04-27 13:21:23,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838126301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:21:23,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:21:23,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:21:23,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154751618] [2022-04-27 13:21:23,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:23,849 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:23,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:23,849 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:23,861 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:23,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:21:23,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:23,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:21:23,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:21:23,863 INFO L87 Difference]: Start difference. First operand 19 states and 21 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:23,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:23,942 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-27 13:21:23,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:21:23,942 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:23,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:23,943 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:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-27 13:21:23,944 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:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-27 13:21:23,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-27 13:21:23,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:23,971 INFO L225 Difference]: With dead ends: 28 [2022-04-27 13:21:23,971 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 13:21:23,972 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:23,975 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:21:23,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:21:23,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 13:21:23,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 13:21:23,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:23,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 13:21:23,986 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 13:21:23,987 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 13:21:23,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:23,988 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 13:21:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 13:21:23,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:23,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:23,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 13:21:23,989 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 13:21:23,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:23,990 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 13:21:23,990 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 13:21:23,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:23,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:23,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:23,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:23,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 13:21:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-27 13:21:23,992 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-27 13:21:23,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:23,992 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-27 13:21:23,992 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:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 13:21:23,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 13:21:23,993 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:23,993 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:24,051 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:24,199 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:24,200 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:24,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:24,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 1 times [2022-04-27 13:21:24,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:24,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611303100] [2022-04-27 13:21:24,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:24,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:24,215 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:24,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1563794278] [2022-04-27 13:21:24,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:24,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:24,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:24,220 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:24,247 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:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:24,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:21:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:24,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:21:24,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {456#true} call ULTIMATE.init(); {456#true} is VALID [2022-04-27 13:21:24,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {464#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:24,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {464#(<= ~counter~0 0)} assume true; {464#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:24,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {464#(<= ~counter~0 0)} {456#true} #54#return; {464#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:24,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {464#(<= ~counter~0 0)} call #t~ret7 := main(); {464#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:24,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {464#(<= ~counter~0 0)} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {464#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:24,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {464#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {480#(<= ~counter~0 1)} is VALID [2022-04-27 13:21:24,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {480#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {480#(<= ~counter~0 1)} is VALID [2022-04-27 13:21:24,428 INFO L272 TraceCheckUtils]: 8: Hoare triple {480#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {480#(<= ~counter~0 1)} is VALID [2022-04-27 13:21:24,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {480#(<= ~counter~0 1)} ~cond := #in~cond; {480#(<= ~counter~0 1)} is VALID [2022-04-27 13:21:24,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {480#(<= ~counter~0 1)} assume !(0 == ~cond); {480#(<= ~counter~0 1)} is VALID [2022-04-27 13:21:24,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {480#(<= ~counter~0 1)} assume true; {480#(<= ~counter~0 1)} is VALID [2022-04-27 13:21:24,436 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {480#(<= ~counter~0 1)} {480#(<= ~counter~0 1)} #50#return; {480#(<= ~counter~0 1)} is VALID [2022-04-27 13:21:24,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {480#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {480#(<= ~counter~0 1)} is VALID [2022-04-27 13:21:24,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {480#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {505#(<= |main_#t~post6| 1)} is VALID [2022-04-27 13:21:24,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {505#(<= |main_#t~post6| 1)} assume !(#t~post6 < 50);havoc #t~post6; {457#false} is VALID [2022-04-27 13:21:24,438 INFO L272 TraceCheckUtils]: 16: Hoare triple {457#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {457#false} is VALID [2022-04-27 13:21:24,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {457#false} ~cond := #in~cond; {457#false} is VALID [2022-04-27 13:21:24,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {457#false} assume 0 == ~cond; {457#false} is VALID [2022-04-27 13:21:24,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {457#false} assume !false; {457#false} is VALID [2022-04-27 13:21:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:21:24,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:21:24,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {457#false} assume !false; {457#false} is VALID [2022-04-27 13:21:24,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {457#false} assume 0 == ~cond; {457#false} is VALID [2022-04-27 13:21:24,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {457#false} ~cond := #in~cond; {457#false} is VALID [2022-04-27 13:21:24,598 INFO L272 TraceCheckUtils]: 16: Hoare triple {457#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {457#false} is VALID [2022-04-27 13:21:24,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {533#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {457#false} is VALID [2022-04-27 13:21:24,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {537#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {533#(< |main_#t~post6| 50)} is VALID [2022-04-27 13:21:24,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {537#(< ~counter~0 50)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {537#(< ~counter~0 50)} is VALID [2022-04-27 13:21:24,600 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {456#true} {537#(< ~counter~0 50)} #50#return; {537#(< ~counter~0 50)} is VALID [2022-04-27 13:21:24,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {456#true} assume true; {456#true} is VALID [2022-04-27 13:21:24,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {456#true} assume !(0 == ~cond); {456#true} is VALID [2022-04-27 13:21:24,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {456#true} ~cond := #in~cond; {456#true} is VALID [2022-04-27 13:21:24,600 INFO L272 TraceCheckUtils]: 8: Hoare triple {537#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {456#true} is VALID [2022-04-27 13:21:24,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {537#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {537#(< ~counter~0 50)} is VALID [2022-04-27 13:21:24,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {562#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {537#(< ~counter~0 50)} is VALID [2022-04-27 13:21:24,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {562#(< ~counter~0 49)} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {562#(< ~counter~0 49)} is VALID [2022-04-27 13:21:24,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {562#(< ~counter~0 49)} call #t~ret7 := main(); {562#(< ~counter~0 49)} is VALID [2022-04-27 13:21:24,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {562#(< ~counter~0 49)} {456#true} #54#return; {562#(< ~counter~0 49)} is VALID [2022-04-27 13:21:24,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {562#(< ~counter~0 49)} assume true; {562#(< ~counter~0 49)} is VALID [2022-04-27 13:21:24,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {562#(< ~counter~0 49)} is VALID [2022-04-27 13:21:24,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {456#true} call ULTIMATE.init(); {456#true} is VALID [2022-04-27 13:21:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:21:24,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:24,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611303100] [2022-04-27 13:21:24,604 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:21:24,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563794278] [2022-04-27 13:21:24,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563794278] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:21:24,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:21:24,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 13:21:24,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592202243] [2022-04-27 13:21:24,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:21:24,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-27 13:21:24,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:24,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:21:24,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:24,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 13:21:24,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:24,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 13:21:24,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:21:24,633 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:21:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:24,782 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-27 13:21:24,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:21:24,783 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2022-04-27 13:21:24,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:24,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:21:24,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-27 13:21:24,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:21:24,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-27 13:21:24,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-27 13:21:24,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:24,849 INFO L225 Difference]: With dead ends: 56 [2022-04-27 13:21:24,849 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 13:21:24,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:21:24,852 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:21:24,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 69 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:21:24,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 13:21:24,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-04-27 13:21:24,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:24,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:21:24,866 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:21:24,867 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:21:24,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:24,869 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-27 13:21:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-04-27 13:21:24,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:24,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:24,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 49 states. [2022-04-27 13:21:24,870 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 49 states. [2022-04-27 13:21:24,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:24,876 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-27 13:21:24,877 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-04-27 13:21:24,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:24,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:24,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:24,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:21:24,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-27 13:21:24,882 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 20 [2022-04-27 13:21:24,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:24,882 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-27 13:21:24,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:21:24,883 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 13:21:24,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 13:21:24,883 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:24,883 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:24,900 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:25,094 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:25,095 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:25,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:25,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 1 times [2022-04-27 13:21:25,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:25,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764586531] [2022-04-27 13:21:25,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:25,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:25,109 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:25,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1983700654] [2022-04-27 13:21:25,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:25,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:25,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:25,111 INFO L229 MonitoredProcess]: Starting monitored process 5 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:25,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 13:21:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:25,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:21:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:25,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:21:25,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {830#true} call ULTIMATE.init(); {830#true} is VALID [2022-04-27 13:21:25,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {830#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {830#true} is VALID [2022-04-27 13:21:25,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2022-04-27 13:21:25,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #54#return; {830#true} is VALID [2022-04-27 13:21:25,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {830#true} call #t~ret7 := main(); {830#true} is VALID [2022-04-27 13:21:25,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {830#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {850#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-27 13:21:25,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {850#(and (= main_~y~0 1) (= main_~x~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {850#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-27 13:21:25,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {850#(and (= main_~y~0 1) (= main_~x~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {850#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-27 13:21:25,280 INFO L272 TraceCheckUtils]: 8: Hoare triple {850#(and (= main_~y~0 1) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {830#true} is VALID [2022-04-27 13:21:25,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {830#true} ~cond := #in~cond; {830#true} is VALID [2022-04-27 13:21:25,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {830#true} assume !(0 == ~cond); {830#true} is VALID [2022-04-27 13:21:25,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {830#true} assume true; {830#true} is VALID [2022-04-27 13:21:25,281 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {830#true} {850#(and (= main_~y~0 1) (= main_~x~0 1))} #50#return; {850#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-27 13:21:25,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {850#(and (= main_~y~0 1) (= main_~x~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {875#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-27 13:21:25,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {875#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {875#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-27 13:21:25,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {875#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} assume !!(#t~post6 < 50);havoc #t~post6; {875#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-27 13:21:25,283 INFO L272 TraceCheckUtils]: 16: Hoare triple {875#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {885#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:21:25,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {885#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {889#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:25,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {889#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {831#false} is VALID [2022-04-27 13:21:25,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {831#false} assume !false; {831#false} is VALID [2022-04-27 13:21:25,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:21:25,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:21:25,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {831#false} assume !false; {831#false} is VALID [2022-04-27 13:21:25,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {889#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {831#false} is VALID [2022-04-27 13:21:25,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {885#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {889#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:25,491 INFO L272 TraceCheckUtils]: 16: Hoare triple {905#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {885#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:21:25,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {905#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} assume !!(#t~post6 < 50);havoc #t~post6; {905#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-27 13:21:25,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {905#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {905#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-27 13:21:25,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {915#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {905#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-27 13:21:25,498 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {830#true} {915#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} #50#return; {915#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-27 13:21:25,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {830#true} assume true; {830#true} is VALID [2022-04-27 13:21:25,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {830#true} assume !(0 == ~cond); {830#true} is VALID [2022-04-27 13:21:25,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {830#true} ~cond := #in~cond; {830#true} is VALID [2022-04-27 13:21:25,498 INFO L272 TraceCheckUtils]: 8: Hoare triple {915#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {830#true} is VALID [2022-04-27 13:21:25,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {915#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} assume !!(#t~post6 < 50);havoc #t~post6; {915#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-27 13:21:25,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {915#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {915#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-27 13:21:25,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {830#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {915#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-27 13:21:25,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {830#true} call #t~ret7 := main(); {830#true} is VALID [2022-04-27 13:21:25,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #54#return; {830#true} is VALID [2022-04-27 13:21:25,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2022-04-27 13:21:25,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {830#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {830#true} is VALID [2022-04-27 13:21:25,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {830#true} call ULTIMATE.init(); {830#true} is VALID [2022-04-27 13:21:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:21:25,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:25,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764586531] [2022-04-27 13:21:25,501 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:21:25,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983700654] [2022-04-27 13:21:25,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983700654] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:21:25,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:21:25,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-27 13:21:25,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260461634] [2022-04-27 13:21:25,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:25,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 13:21:25,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:25,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:21:25,522 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-27 13:21:25,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:21:25,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:25,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:21:25,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:21:25,522 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:21:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:25,613 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 13:21:25,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:21:25,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 13:21:25,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:25,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:21:25,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-27 13:21:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:21:25,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-27 13:21:25,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-27 13:21:25,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:25,646 INFO L225 Difference]: With dead ends: 45 [2022-04-27 13:21:25,646 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 13:21:25,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:21:25,647 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:21:25,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 39 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:21:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 13:21:25,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 13:21:25,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:25,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 13:21:25,648 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 13:21:25,648 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 13:21:25,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:25,648 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:21:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:21:25,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:25,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:25,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 13:21:25,649 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 13:21:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:25,649 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:21:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:21:25,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:25,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:25,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:25,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:25,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 13:21:25,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 13:21:25,650 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-27 13:21:25,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:25,650 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 13:21:25,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:21:25,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:21:25,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:25,652 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:21:25,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 13:21:25,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:25,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 13:21:25,911 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-27 13:21:25,911 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-27 13:21:25,911 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-27 13:21:25,911 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed. [2022-04-27 13:21:25,911 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-27 13:21:25,912 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-27 13:21:25,912 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-27 13:21:25,912 INFO L899 garLoopResultBuilder]: For program point L34-1(lines 34 43) no Hoare annotation was computed. [2022-04-27 13:21:25,912 INFO L895 garLoopResultBuilder]: At program point L34-3(lines 34 43) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))) [2022-04-27 13:21:25,912 INFO L895 garLoopResultBuilder]: At program point L34-4(lines 34 43) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))) [2022-04-27 13:21:25,912 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 24 46) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-27 13:21:25,912 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 46) no Hoare annotation was computed. [2022-04-27 13:21:25,912 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 24 46) no Hoare annotation was computed. [2022-04-27 13:21:25,912 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-04-27 13:21:25,913 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))) [2022-04-27 13:21:25,913 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 34 43) no Hoare annotation was computed. [2022-04-27 13:21:25,913 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:21:25,913 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 13:21:25,913 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:21:25,913 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:21:25,913 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-27 13:21:25,913 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 13:21:25,913 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:21:25,913 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-27 13:21:25,913 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-27 13:21:25,913 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-27 13:21:25,913 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-27 13:21:25,914 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-27 13:21:25,914 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-27 13:21:25,916 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-27 13:21:25,917 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:21:25,920 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:21:25,920 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:21:25,921 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 13:21:25,922 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:21:25,922 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:21:25,922 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:21:25,922 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:21:25,923 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:21:25,923 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:21:25,923 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:21:25,923 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:21:25,923 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:21:25,924 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:21:25,924 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:21:25,924 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 13:21:25,924 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 13:21:25,924 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:21:25,924 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:21:25,924 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:21:25,924 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:21:25,924 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 13:21:25,924 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 13:21:25,924 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:21:25,924 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:21:25,924 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:21:25,924 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:21:25,924 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:21:25,925 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:21:25,925 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:21:25,925 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:21:25,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:21:25 BoogieIcfgContainer [2022-04-27 13:21:25,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:21:25,932 INFO L158 Benchmark]: Toolchain (without parser) took 3939.95ms. Allocated memory was 187.7MB in the beginning and 284.2MB in the end (delta: 96.5MB). Free memory was 129.7MB in the beginning and 181.2MB in the end (delta: -51.6MB). Peak memory consumption was 46.0MB. Max. memory is 8.0GB. [2022-04-27 13:21:25,932 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory was 146.0MB in the beginning and 145.9MB in the end (delta: 147.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:21:25,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.89ms. Allocated memory was 187.7MB in the beginning and 284.2MB in the end (delta: 96.5MB). Free memory was 129.5MB in the beginning and 257.3MB in the end (delta: -127.8MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. [2022-04-27 13:21:25,933 INFO L158 Benchmark]: Boogie Preprocessor took 34.06ms. Allocated memory is still 284.2MB. Free memory was 257.3MB in the beginning and 255.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 13:21:25,933 INFO L158 Benchmark]: RCFGBuilder took 242.26ms. Allocated memory is still 284.2MB. Free memory was 255.8MB in the beginning and 244.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 13:21:25,933 INFO L158 Benchmark]: TraceAbstraction took 3456.84ms. Allocated memory is still 284.2MB. Free memory was 243.7MB in the beginning and 181.8MB in the end (delta: 61.9MB). Peak memory consumption was 63.5MB. Max. memory is 8.0GB. [2022-04-27 13:21:25,934 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 187.7MB. Free memory was 146.0MB in the beginning and 145.9MB in the end (delta: 147.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 201.89ms. Allocated memory was 187.7MB in the beginning and 284.2MB in the end (delta: 96.5MB). Free memory was 129.5MB in the beginning and 257.3MB in the end (delta: -127.8MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.06ms. Allocated memory is still 284.2MB. Free memory was 257.3MB in the beginning and 255.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 242.26ms. Allocated memory is still 284.2MB. Free memory was 255.8MB in the beginning and 244.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3456.84ms. Allocated memory is still 284.2MB. Free memory was 243.7MB in the beginning and 181.8MB in the end (delta: 61.9MB). Peak memory consumption was 63.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 237 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 76 IncrementalHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 89 mSDtfsCounter, 76 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=4, InterpolantAutomatonStates: 27, 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, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 19 PreInvPairs, 32 NumberOfFragments, 71 HoareAnnotationTreeSize, 19 FomulaSimplifications, 149 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 59 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 SizeOfPredicates, 6 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 11/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: !(\old(counter) <= 0) || x + z * y == z * x + 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 13:21:25,959 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...