/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/geo3-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:21:34,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:21:34,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:21:34,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:21:34,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:21:34,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:21:34,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:21:34,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:21:34,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:21:34,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:21:34,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:21:34,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:21:34,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:21:34,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:21:34,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:21:34,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:21:34,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:21:34,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:21:34,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:21:34,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:21:34,464 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:21:34,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:21:34,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:21:34,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:21:34,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:21:34,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:21:34,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:21:34,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:21:34,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:21:34,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:21:34,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:21:34,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:21:34,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:21:34,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:21:34,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:21:34,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:21:34,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:21:34,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:21:34,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:21:34,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:21:34,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:21:34,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:21:34,494 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:34,515 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:21:34,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:21:34,515 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:21:34,515 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:21:34,516 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:21:34,516 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:21:34,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:21:34,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:21:34,516 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:21:34,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:21:34,516 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:21:34,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:21:34,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:21:34,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:21:34,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:21:34,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:21:34,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:21:34,518 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:21:34,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:21:34,518 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:21:34,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:21:34,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:21:34,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:21:34,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:21:34,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:21:34,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:21:34,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:21:34,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:21:34,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:21:34,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:21:34,519 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:21:34,519 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:21:34,520 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:21:34,520 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:34,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:21:34,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:21:34,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:21:34,706 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:21:34,706 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:21:34,707 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound5.c [2022-04-27 13:21:34,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c7fbad72/cd92029d1c774167a732c709f5577db2/FLAGede085b7d [2022-04-27 13:21:35,101 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:21:35,101 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound5.c [2022-04-27 13:21:35,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c7fbad72/cd92029d1c774167a732c709f5577db2/FLAGede085b7d [2022-04-27 13:21:35,114 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c7fbad72/cd92029d1c774167a732c709f5577db2 [2022-04-27 13:21:35,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:21:35,116 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:21:35,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:21:35,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:21:35,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:21:35,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:21:35" (1/1) ... [2022-04-27 13:21:35,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f752c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:35, skipping insertion in model container [2022-04-27 13:21:35,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:21:35" (1/1) ... [2022-04-27 13:21:35,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:21:35,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:21:35,253 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/geo3-ll_unwindbound5.c[525,538] [2022-04-27 13:21:35,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:21:35,281 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:21:35,297 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/geo3-ll_unwindbound5.c[525,538] [2022-04-27 13:21:35,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:21:35,314 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:21:35,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:35 WrapperNode [2022-04-27 13:21:35,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:21:35,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:21:35,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:21:35,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:21:35,322 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:35" (1/1) ... [2022-04-27 13:21:35,322 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:35" (1/1) ... [2022-04-27 13:21:35,325 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:35" (1/1) ... [2022-04-27 13:21:35,325 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:35" (1/1) ... [2022-04-27 13:21:35,330 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:35" (1/1) ... [2022-04-27 13:21:35,333 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:35" (1/1) ... [2022-04-27 13:21:35,334 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:35" (1/1) ... [2022-04-27 13:21:35,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:21:35,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:21:35,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:21:35,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:21:35,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:35" (1/1) ... [2022-04-27 13:21:35,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:21:35,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:35,366 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:35,370 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:35,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:21:35,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:21:35,389 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:21:35,389 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:21:35,389 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:21:35,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:21:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:21:35,390 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:21:35,390 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:21:35,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:21:35,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:21:35,390 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:21:35,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:21:35,390 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:21:35,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:21:35,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:21:35,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:21:35,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:21:35,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:21:35,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:21:35,430 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:21:35,431 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:21:35,530 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:21:35,534 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:21:35,534 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 13:21:35,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:21:35 BoogieIcfgContainer [2022-04-27 13:21:35,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:21:35,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:21:35,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:21:35,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:21:35,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:21:35" (1/3) ... [2022-04-27 13:21:35,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@992b811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:21:35, skipping insertion in model container [2022-04-27 13:21:35,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:35" (2/3) ... [2022-04-27 13:21:35,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@992b811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:21:35, skipping insertion in model container [2022-04-27 13:21:35,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:21:35" (3/3) ... [2022-04-27 13:21:35,555 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_unwindbound5.c [2022-04-27 13:21:35,569 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:21:35,569 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:21:35,603 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:21:35,616 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@4bf50ae8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2040568f [2022-04-27 13:21:35,616 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:21:35,624 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:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 13:21:35,629 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:35,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:35,630 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:35,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:35,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times [2022-04-27 13:21:35,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:35,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232734261] [2022-04-27 13:21:35,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:35,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:35,732 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:35,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1148621701] [2022-04-27 13:21:35,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:35,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:35,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:35,735 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:35,736 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:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:35,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-27 13:21:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:35,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:21:35,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2022-04-27 13:21:35,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#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; {25#true} is VALID [2022-04-27 13:21:35,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 13:21:35,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-27 13:21:35,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret8 := main(); {25#true} is VALID [2022-04-27 13:21:35,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {25#true} is VALID [2022-04-27 13:21:35,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-27 13:21:35,863 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {26#false} is VALID [2022-04-27 13:21:35,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-27 13:21:35,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-27 13:21:35,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-27 13:21:35,864 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:35,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:21:35,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:35,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232734261] [2022-04-27 13:21:35,865 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:21:35,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148621701] [2022-04-27 13:21:35,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148621701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:21:35,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:21:35,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-27 13:21:35,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852116203] [2022-04-27 13:21:35,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:35,871 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 13:21:35,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:35,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:35,891 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:35,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-27 13:21:35,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:35,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-27 13:21:35,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 13:21:35,909 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:35,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:35,944 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-27 13:21:35,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-27 13:21:35,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 13:21:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:35,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-04-27 13:21:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-04-27 13:21:35,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 48 transitions. [2022-04-27 13:21:35,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:36,004 INFO L225 Difference]: With dead ends: 38 [2022-04-27 13:21:36,004 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 13:21:36,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 13:21:36,008 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:21:36,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:21:36,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 13:21:36,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 13:21:36,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:36,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 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:36,034 INFO L74 IsIncluded]: Start isIncluded. First operand 17 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:36,035 INFO L87 Difference]: Start difference. First operand 17 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:36,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:36,042 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 13:21:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 13:21:36,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:36,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:36,044 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 17 states. [2022-04-27 13:21:36,045 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 17 states. [2022-04-27 13:21:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:36,047 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 13:21:36,047 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 13:21:36,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:36,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:36,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:36,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:36,052 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:36,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 13:21:36,059 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-27 13:21:36,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:36,059 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 13:21:36,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:36,059 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 13:21:36,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 13:21:36,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:36,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:36,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 13:21:36,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-27 13:21:36,272 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:36,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:36,273 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times [2022-04-27 13:21:36,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:36,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321455721] [2022-04-27 13:21:36,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:36,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:36,285 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:36,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930119239] [2022-04-27 13:21:36,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:36,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:36,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:36,286 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:36,287 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:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:36,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:21:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:36,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:21:36,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2022-04-27 13:21:36,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#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; {176#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:36,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#(<= ~counter~0 0)} assume true; {176#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:36,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176#(<= ~counter~0 0)} {168#true} #54#return; {176#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:36,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {176#(<= ~counter~0 0)} call #t~ret8 := main(); {176#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:36,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {176#(<= ~counter~0 0)} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {176#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:36,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {176#(<= ~counter~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192#(<= |main_#t~post7| 0)} is VALID [2022-04-27 13:21:36,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {192#(<= |main_#t~post7| 0)} assume !(#t~post7 < 5);havoc #t~post7; {169#false} is VALID [2022-04-27 13:21:36,430 INFO L272 TraceCheckUtils]: 8: Hoare triple {169#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {169#false} is VALID [2022-04-27 13:21:36,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#false} ~cond := #in~cond; {169#false} is VALID [2022-04-27 13:21:36,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {169#false} assume 0 == ~cond; {169#false} is VALID [2022-04-27 13:21:36,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {169#false} assume !false; {169#false} is VALID [2022-04-27 13:21:36,431 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:36,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:21:36,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:36,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321455721] [2022-04-27 13:21:36,431 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:21:36,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930119239] [2022-04-27 13:21:36,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930119239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:21:36,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:21:36,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:21:36,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007436781] [2022-04-27 13:21:36,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:36,433 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:36,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:36,433 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:36,443 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:36,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:21:36,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:36,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:21:36,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:21:36,444 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:36,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:36,479 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-27 13:21:36,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:21:36,480 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:36,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:36,480 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:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-27 13:21:36,517 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:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-27 13:21:36,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-27 13:21:36,544 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:36,546 INFO L225 Difference]: With dead ends: 26 [2022-04-27 13:21:36,546 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 13:21:36,546 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:36,550 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:36,550 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:36,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 13:21:36,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-27 13:21:36,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:36,564 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:36,564 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:36,565 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:36,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:36,566 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 13:21:36,566 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 13:21:36,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:36,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:36,566 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:36,566 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:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:36,567 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 13:21:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 13:21:36,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:36,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:36,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:36,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:36,568 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:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-27 13:21:36,569 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-27 13:21:36,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:36,569 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-27 13:21:36,569 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:36,570 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 13:21:36,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 13:21:36,570 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:36,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:36,588 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:36,770 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,SelfDestructingSolverStorable1 [2022-04-27 13:21:36,771 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:36,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:36,772 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times [2022-04-27 13:21:36,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:36,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130917230] [2022-04-27 13:21:36,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:36,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:36,793 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:36,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1840930310] [2022-04-27 13:21:36,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:36,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:36,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:36,796 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:36,797 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:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:36,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:21:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:36,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:21:36,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {310#true} call ULTIMATE.init(); {310#true} is VALID [2022-04-27 13:21:36,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#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; {310#true} is VALID [2022-04-27 13:21:36,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#true} assume true; {310#true} is VALID [2022-04-27 13:21:36,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {310#true} {310#true} #54#return; {310#true} is VALID [2022-04-27 13:21:36,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {310#true} call #t~ret8 := main(); {310#true} is VALID [2022-04-27 13:21:36,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {310#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {330#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-27 13:21:36,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {330#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {330#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-27 13:21:36,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {330#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(#t~post7 < 5);havoc #t~post7; {330#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-27 13:21:36,983 INFO L272 TraceCheckUtils]: 8: Hoare triple {330#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {340#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:21:36,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {344#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:36,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {344#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {311#false} is VALID [2022-04-27 13:21:36,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {311#false} assume !false; {311#false} is VALID [2022-04-27 13:21:36,985 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:36,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:21:36,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:36,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130917230] [2022-04-27 13:21:36,986 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:21:36,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840930310] [2022-04-27 13:21:36,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840930310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:21:36,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:21:36,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:21:36,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315331103] [2022-04-27 13:21:36,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:36,988 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:36,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:36,988 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:36,998 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:36,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:21:36,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:36,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:21:36,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:21:36,999 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:37,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:37,090 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-27 13:21:37,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:21:37,090 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:37,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:37,091 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:37,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-27 13:21:37,096 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:37,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-27 13:21:37,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-27 13:21:37,120 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:37,123 INFO L225 Difference]: With dead ends: 28 [2022-04-27 13:21:37,123 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 13:21:37,124 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:37,127 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:37,130 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:37,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 13:21:37,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 13:21:37,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:37,140 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:37,143 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:37,143 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:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:37,144 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 13:21:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 13:21:37,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:37,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:37,145 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:37,145 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:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:37,151 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 13:21:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 13:21:37,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:37,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:37,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:37,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:37,152 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:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-27 13:21:37,153 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-27 13:21:37,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:37,153 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-27 13:21:37,154 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:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 13:21:37,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 13:21:37,154 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:37,154 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:37,177 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:37,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:37,360 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:37,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:37,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 1 times [2022-04-27 13:21:37,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:37,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894424096] [2022-04-27 13:21:37,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:37,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:37,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:37,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1373111760] [2022-04-27 13:21:37,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:37,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:37,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:37,397 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:37,398 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:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:37,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:21:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:37,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:21:37,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {478#true} call ULTIMATE.init(); {478#true} is VALID [2022-04-27 13:21:37,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {486#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:37,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {486#(<= ~counter~0 0)} assume true; {486#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:37,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {486#(<= ~counter~0 0)} {478#true} #54#return; {486#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:37,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {486#(<= ~counter~0 0)} call #t~ret8 := main(); {486#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:37,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {486#(<= ~counter~0 0)} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {486#(<= ~counter~0 0)} is VALID [2022-04-27 13:21:37,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {486#(<= ~counter~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {502#(<= ~counter~0 1)} is VALID [2022-04-27 13:21:37,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {502#(<= ~counter~0 1)} assume !!(#t~post7 < 5);havoc #t~post7; {502#(<= ~counter~0 1)} is VALID [2022-04-27 13:21:37,573 INFO L272 TraceCheckUtils]: 8: Hoare triple {502#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {502#(<= ~counter~0 1)} is VALID [2022-04-27 13:21:37,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {502#(<= ~counter~0 1)} ~cond := #in~cond; {502#(<= ~counter~0 1)} is VALID [2022-04-27 13:21:37,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {502#(<= ~counter~0 1)} assume !(0 == ~cond); {502#(<= ~counter~0 1)} is VALID [2022-04-27 13:21:37,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#(<= ~counter~0 1)} assume true; {502#(<= ~counter~0 1)} is VALID [2022-04-27 13:21:37,575 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {502#(<= ~counter~0 1)} {502#(<= ~counter~0 1)} #50#return; {502#(<= ~counter~0 1)} is VALID [2022-04-27 13:21:37,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {502#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {502#(<= ~counter~0 1)} is VALID [2022-04-27 13:21:37,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {502#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {527#(<= |main_#t~post7| 1)} is VALID [2022-04-27 13:21:37,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {527#(<= |main_#t~post7| 1)} assume !(#t~post7 < 5);havoc #t~post7; {479#false} is VALID [2022-04-27 13:21:37,579 INFO L272 TraceCheckUtils]: 16: Hoare triple {479#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {479#false} is VALID [2022-04-27 13:21:37,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {479#false} ~cond := #in~cond; {479#false} is VALID [2022-04-27 13:21:37,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {479#false} assume 0 == ~cond; {479#false} is VALID [2022-04-27 13:21:37,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {479#false} assume !false; {479#false} is VALID [2022-04-27 13:21:37,580 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:37,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:21:37,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {479#false} assume !false; {479#false} is VALID [2022-04-27 13:21:37,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {479#false} assume 0 == ~cond; {479#false} is VALID [2022-04-27 13:21:37,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {479#false} ~cond := #in~cond; {479#false} is VALID [2022-04-27 13:21:37,710 INFO L272 TraceCheckUtils]: 16: Hoare triple {479#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {479#false} is VALID [2022-04-27 13:21:37,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {555#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {479#false} is VALID [2022-04-27 13:21:37,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {559#(< ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {555#(< |main_#t~post7| 5)} is VALID [2022-04-27 13:21:37,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {559#(< ~counter~0 5)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {559#(< ~counter~0 5)} is VALID [2022-04-27 13:21:37,712 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {478#true} {559#(< ~counter~0 5)} #50#return; {559#(< ~counter~0 5)} is VALID [2022-04-27 13:21:37,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {478#true} assume true; {478#true} is VALID [2022-04-27 13:21:37,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {478#true} assume !(0 == ~cond); {478#true} is VALID [2022-04-27 13:21:37,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {478#true} ~cond := #in~cond; {478#true} is VALID [2022-04-27 13:21:37,713 INFO L272 TraceCheckUtils]: 8: Hoare triple {559#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {478#true} is VALID [2022-04-27 13:21:37,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {559#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {559#(< ~counter~0 5)} is VALID [2022-04-27 13:21:37,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#(< ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {559#(< ~counter~0 5)} is VALID [2022-04-27 13:21:37,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {584#(< ~counter~0 4)} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {584#(< ~counter~0 4)} is VALID [2022-04-27 13:21:37,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {584#(< ~counter~0 4)} call #t~ret8 := main(); {584#(< ~counter~0 4)} is VALID [2022-04-27 13:21:37,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {584#(< ~counter~0 4)} {478#true} #54#return; {584#(< ~counter~0 4)} is VALID [2022-04-27 13:21:37,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {584#(< ~counter~0 4)} assume true; {584#(< ~counter~0 4)} is VALID [2022-04-27 13:21:37,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {584#(< ~counter~0 4)} is VALID [2022-04-27 13:21:37,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {478#true} call ULTIMATE.init(); {478#true} is VALID [2022-04-27 13:21:37,716 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:37,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:37,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894424096] [2022-04-27 13:21:37,716 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:21:37,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373111760] [2022-04-27 13:21:37,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373111760] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:21:37,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:21:37,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 13:21:37,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799144955] [2022-04-27 13:21:37,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:21:37,717 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:37,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:37,717 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:37,740 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:37,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 13:21:37,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:37,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 13:21:37,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:21:37,741 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:37,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:37,879 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-27 13:21:37,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:21:37,879 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:37,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:37,880 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:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-27 13:21:37,882 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:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-27 13:21:37,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-27 13:21:37,945 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:37,947 INFO L225 Difference]: With dead ends: 56 [2022-04-27 13:21:37,947 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 13:21:37,947 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:37,948 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:21:37,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 78 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:21:37,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 13:21:37,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-04-27 13:21:37,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:37,963 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:37,963 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:37,963 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:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:37,965 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-27 13:21:37,965 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-04-27 13:21:37,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:37,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:37,966 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:37,966 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:37,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:37,967 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-27 13:21:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-04-27 13:21:37,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:37,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:37,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:37,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:37,968 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:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-27 13:21:37,969 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 20 [2022-04-27 13:21:37,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:37,969 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-27 13:21:37,970 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:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 13:21:37,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 13:21:37,970 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:37,970 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:37,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 13:21:38,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:38,183 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:38,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:38,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 1 times [2022-04-27 13:21:38,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:38,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343936021] [2022-04-27 13:21:38,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:38,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:38,192 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:38,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1115844658] [2022-04-27 13:21:38,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:38,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:38,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:38,195 INFO L229 MonitoredProcess]: Starting monitored process 6 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:38,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 13:21:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:38,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 13:21:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:38,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:21:38,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {852#true} call ULTIMATE.init(); {852#true} is VALID [2022-04-27 13:21:38,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {852#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; {852#true} is VALID [2022-04-27 13:21:38,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {852#true} assume true; {852#true} is VALID [2022-04-27 13:21:38,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {852#true} {852#true} #54#return; {852#true} is VALID [2022-04-27 13:21:38,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {852#true} call #t~ret8 := main(); {852#true} is VALID [2022-04-27 13:21:38,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {852#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {872#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-27 13:21:38,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {872#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {872#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-27 13:21:38,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {872#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(#t~post7 < 5);havoc #t~post7; {872#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-27 13:21:38,620 INFO L272 TraceCheckUtils]: 8: Hoare triple {872#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {852#true} is VALID [2022-04-27 13:21:38,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {852#true} ~cond := #in~cond; {885#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:38,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {885#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {889#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:21:38,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {889#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {889#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:21:38,621 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {889#(not (= |__VERIFIER_assert_#in~cond| 0))} {872#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #50#return; {872#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-27 13:21:38,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {872#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {899#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-27 13:21:38,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {899#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {899#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-27 13:21:38,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {899#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(#t~post7 < 5);havoc #t~post7; {899#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-27 13:21:38,678 INFO L272 TraceCheckUtils]: 16: Hoare triple {899#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {909#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:21:38,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {909#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {913#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:38,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {853#false} is VALID [2022-04-27 13:21:38,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {853#false} assume !false; {853#false} is VALID [2022-04-27 13:21:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:21:38,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:21:52,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {853#false} assume !false; {853#false} is VALID [2022-04-27 13:21:52,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {853#false} is VALID [2022-04-27 13:21:52,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {909#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {913#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:52,482 INFO L272 TraceCheckUtils]: 16: Hoare triple {929#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {909#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:21:52,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {929#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !!(#t~post7 < 5);havoc #t~post7; {929#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-27 13:21:52,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {929#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {929#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-27 13:21:52,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {939#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {929#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-27 13:21:52,512 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {889#(not (= |__VERIFIER_assert_#in~cond| 0))} {852#true} #50#return; {939#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-27 13:21:52,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {889#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {889#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:21:52,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {952#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {889#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:21:52,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {852#true} ~cond := #in~cond; {952#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:21:52,513 INFO L272 TraceCheckUtils]: 8: Hoare triple {852#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {852#true} is VALID [2022-04-27 13:21:52,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {852#true} assume !!(#t~post7 < 5);havoc #t~post7; {852#true} is VALID [2022-04-27 13:21:52,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {852#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {852#true} is VALID [2022-04-27 13:21:52,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {852#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {852#true} is VALID [2022-04-27 13:21:52,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {852#true} call #t~ret8 := main(); {852#true} is VALID [2022-04-27 13:21:52,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {852#true} {852#true} #54#return; {852#true} is VALID [2022-04-27 13:21:52,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {852#true} assume true; {852#true} is VALID [2022-04-27 13:21:52,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {852#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; {852#true} is VALID [2022-04-27 13:21:52,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {852#true} call ULTIMATE.init(); {852#true} is VALID [2022-04-27 13:21:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:21:52,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:52,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343936021] [2022-04-27 13:21:52,514 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:21:52,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115844658] [2022-04-27 13:21:52,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115844658] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:21:52,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:21:52,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-27 13:21:52,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186545000] [2022-04-27 13:21:52,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:21:52,515 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-04-27 13:21:52,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:52,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:21:52,612 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:52,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 13:21:52,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:52,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 13:21:52,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:21:52,613 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:21:53,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:53,740 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 13:21:53,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:21:53,740 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-04-27 13:21:53,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:21:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-27 13:21:53,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:21:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-27 13:21:53,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-27 13:21:54,118 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:54,119 INFO L225 Difference]: With dead ends: 45 [2022-04-27 13:21:54,119 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 13:21:54,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:21:54,120 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:21:54,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 102 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 13:21:54,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 13:21:54,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 13:21:54,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:54,121 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:54,121 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:54,121 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:54,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:54,121 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:21:54,121 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:21:54,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:54,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:54,122 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:54,122 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:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:54,122 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:21:54,122 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:21:54,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:54,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:54,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:54,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:54,122 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:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 13:21:54,122 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-27 13:21:54,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:54,123 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 13:21:54,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:21:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:21:54,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:54,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:21:54,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 13:21:54,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:54,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 13:21:54,470 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-27 13:21:54,471 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-27 13:21:54,471 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-27 13:21:54,471 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed. [2022-04-27 13:21:54,471 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-27 13:21:54,471 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-27 13:21:54,471 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-27 13:21:54,471 INFO L899 garLoopResultBuilder]: For program point L34-1(lines 34 43) no Hoare annotation was computed. [2022-04-27 13:21:54,471 INFO L895 garLoopResultBuilder]: At program point L34-3(lines 34 43) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))) [2022-04-27 13:21:54,471 INFO L895 garLoopResultBuilder]: At program point L34-4(lines 34 43) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))) [2022-04-27 13:21:54,471 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 22 46) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (<= ~counter~0 0)) [2022-04-27 13:21:54,471 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 22 46) no Hoare annotation was computed. [2022-04-27 13:21:54,471 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 22 46) no Hoare annotation was computed. [2022-04-27 13:21:54,471 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-04-27 13:21:54,472 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))) [2022-04-27 13:21:54,472 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 34 43) no Hoare annotation was computed. [2022-04-27 13:21:54,472 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:21:54,472 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-27 13:21:54,472 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:21:54,472 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:21:54,472 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-27 13:21:54,472 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 13:21:54,472 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:21:54,472 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-27 13:21:54,472 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-27 13:21:54,472 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-27 13:21:54,472 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-27 13:21:54,472 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-27 13:21:54,472 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-27 13:21:54,474 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-27 13:21:54,476 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:21:54,478 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:21:54,478 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:21:54,478 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 13:21:54,482 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:21:54,482 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:21:54,482 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:21:54,482 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:21:54,483 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:21:54,483 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:21:54,483 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:21:54,483 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:21:54,483 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:21:54,483 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:21:54,483 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:21:54,483 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 13:21:54,483 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 13:21:54,483 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:21:54,483 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:21:54,483 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:21:54,483 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:21:54,484 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 13:21:54,484 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 13:21:54,484 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:21:54,484 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:21:54,484 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:21:54,484 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:21:54,484 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:21:54,484 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:21:54,484 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:21:54,484 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:54,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:21:54 BoogieIcfgContainer [2022-04-27 13:21:54,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:21:54,493 INFO L158 Benchmark]: Toolchain (without parser) took 19376.82ms. Allocated memory was 174.1MB in the beginning and 220.2MB in the end (delta: 46.1MB). Free memory was 123.8MB in the beginning and 135.8MB in the end (delta: -12.0MB). Peak memory consumption was 34.5MB. Max. memory is 8.0GB. [2022-04-27 13:21:54,493 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 174.1MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:21:54,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.99ms. Allocated memory is still 174.1MB. Free memory was 123.5MB in the beginning and 148.3MB in the end (delta: -24.8MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-04-27 13:21:54,494 INFO L158 Benchmark]: Boogie Preprocessor took 19.19ms. Allocated memory is still 174.1MB. Free memory was 148.3MB in the beginning and 147.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 13:21:54,494 INFO L158 Benchmark]: RCFGBuilder took 200.64ms. Allocated memory is still 174.1MB. Free memory was 146.8MB in the beginning and 136.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 13:21:54,495 INFO L158 Benchmark]: TraceAbstraction took 18955.66ms. Allocated memory was 174.1MB in the beginning and 220.2MB in the end (delta: 46.1MB). Free memory was 135.7MB in the beginning and 136.3MB in the end (delta: -591.1kB). Peak memory consumption was 46.6MB. Max. memory is 8.0GB. [2022-04-27 13:21:54,496 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.24ms. Allocated memory is still 174.1MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.99ms. Allocated memory is still 174.1MB. Free memory was 123.5MB in the beginning and 148.3MB in the end (delta: -24.8MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.19ms. Allocated memory is still 174.1MB. Free memory was 148.3MB in the beginning and 147.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 200.64ms. Allocated memory is still 174.1MB. Free memory was 146.8MB in the beginning and 136.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 18955.66ms. Allocated memory was 174.1MB in the beginning and 220.2MB in the end (delta: 46.1MB). Free memory was 135.7MB in the beginning and 136.3MB in the end (delta: -591.1kB). Peak memory consumption was 46.6MB. 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: 18.9s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 306 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 93 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=4, InterpolantAutomatonStates: 28, 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 19 PreInvPairs, 32 NumberOfFragments, 62 HoareAnnotationTreeSize, 19 FomulaSimplifications, 60 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 147 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 372 SizeOfPredicates, 6 NumberOfNonLiveVariables, 443 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 9/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) || y * az + x == z * x + a RESULT: Ultimate proved your program to be correct! [2022-04-27 13:21:54,513 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...