/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/geo3-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 14:50:14,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 14:50:14,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 14:50:14,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 14:50:14,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 14:50:14,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 14:50:14,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 14:50:14,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 14:50:14,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 14:50:14,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 14:50:14,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 14:50:14,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 14:50:14,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 14:50:14,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 14:50:14,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 14:50:14,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 14:50:14,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 14:50:14,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 14:50:14,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 14:50:14,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 14:50:14,177 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 14:50:14,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 14:50:14,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 14:50:14,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 14:50:14,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 14:50:14,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 14:50:14,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 14:50:14,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 14:50:14,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 14:50:14,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 14:50:14,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 14:50:14,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 14:50:14,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 14:50:14,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 14:50:14,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 14:50:14,184 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 14:50:14,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 14:50:14,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 14:50:14,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 14:50:14,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 14:50:14,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 14:50:14,186 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 14:50:14,187 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-14 14:50:14,200 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 14:50:14,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 14:50:14,201 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 14:50:14,201 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 14:50:14,202 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 14:50:14,202 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 14:50:14,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 14:50:14,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 14:50:14,202 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 14:50:14,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 14:50:14,202 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 14:50:14,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 14:50:14,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 14:50:14,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 14:50:14,203 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 14:50:14,203 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 14:50:14,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 14:50:14,203 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 14:50:14,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 14:50:14,203 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 14:50:14,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 14:50:14,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 14:50:14,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 14:50:14,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 14:50:14,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 14:50:14,204 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 14:50:14,204 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 14:50:14,204 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 14:50:14,204 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 14:50:14,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 14:50:14,205 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 14:50:14,205 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 14:50:14,205 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 14:50:14,205 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-14 14:50:14,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 14:50:14,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 14:50:14,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 14:50:14,415 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 14:50:14,415 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 14:50:14,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/geo3-ll.c [2022-04-14 14:50:14,457 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c34f1f068/aa0cf900561c46d6bbc7fe1a582ba933/FLAGd425996df [2022-04-14 14:50:14,847 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 14:50:14,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo3-ll.c [2022-04-14 14:50:14,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c34f1f068/aa0cf900561c46d6bbc7fe1a582ba933/FLAGd425996df [2022-04-14 14:50:14,868 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c34f1f068/aa0cf900561c46d6bbc7fe1a582ba933 [2022-04-14 14:50:14,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 14:50:14,870 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 14:50:14,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 14:50:14,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 14:50:14,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 14:50:14,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:50:14" (1/1) ... [2022-04-14 14:50:14,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b847cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:50:14, skipping insertion in model container [2022-04-14 14:50:14,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:50:14" (1/1) ... [2022-04-14 14:50:14,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 14:50:14,895 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 14:50:15,044 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/geo3-ll.c[525,538] [2022-04-14 14:50:15,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 14:50:15,072 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 14:50:15,081 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/geo3-ll.c[525,538] [2022-04-14 14:50:15,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 14:50:15,105 INFO L208 MainTranslator]: Completed translation [2022-04-14 14:50:15,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:50:15 WrapperNode [2022-04-14 14:50:15,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 14:50:15,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 14:50:15,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 14:50:15,107 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 14:50:15,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:50:15" (1/1) ... [2022-04-14 14:50:15,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:50:15" (1/1) ... [2022-04-14 14:50:15,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:50:15" (1/1) ... [2022-04-14 14:50:15,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:50:15" (1/1) ... [2022-04-14 14:50:15,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:50:15" (1/1) ... [2022-04-14 14:50:15,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:50:15" (1/1) ... [2022-04-14 14:50:15,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:50:15" (1/1) ... [2022-04-14 14:50:15,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 14:50:15,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 14:50:15,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 14:50:15,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 14:50:15,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:50:15" (1/1) ... [2022-04-14 14:50:15,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 14:50:15,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:50:15,162 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-14 14:50:15,180 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-14 14:50:15,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 14:50:15,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 14:50:15,191 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 14:50:15,191 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 14:50:15,193 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 14:50:15,193 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 14:50:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 14:50:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 14:50:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 14:50:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 14:50:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 14:50:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 14:50:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 14:50:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 14:50:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 14:50:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 14:50:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 14:50:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 14:50:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 14:50:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 14:50:15,241 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 14:50:15,242 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 14:50:15,392 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 14:50:15,397 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 14:50:15,397 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 14:50:15,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 02:50:15 BoogieIcfgContainer [2022-04-14 14:50:15,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 14:50:15,399 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 14:50:15,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 14:50:15,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 14:50:15,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 02:50:14" (1/3) ... [2022-04-14 14:50:15,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ac0753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:50:15, skipping insertion in model container [2022-04-14 14:50:15,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:50:15" (2/3) ... [2022-04-14 14:50:15,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ac0753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:50:15, skipping insertion in model container [2022-04-14 14:50:15,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 02:50:15" (3/3) ... [2022-04-14 14:50:15,411 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll.c [2022-04-14 14:50:15,415 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 14:50:15,415 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 14:50:15,474 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 14:50:15,482 INFO L340 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 [2022-04-14 14:50:15,482 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 14:50:15,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-14 14:50:15,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 14:50:15,503 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:50:15,503 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:50:15,503 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:50:15,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:50:15,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1469283919, now seen corresponding path program 1 times [2022-04-14 14:50:15,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:50:15,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179513617] [2022-04-14 14:50:15,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:50:15,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:50:15,596 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:50:15,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1264926480] [2022-04-14 14:50:15,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:50:15,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:50:15,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:50:15,598 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-14 14:50:15,599 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-14 14:50:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:50:15,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-14 14:50:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:50:15,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:50:15,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2022-04-14 14:50:15,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#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); {24#true} is VALID [2022-04-14 14:50:15,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-14 14:50:15,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #53#return; {24#true} is VALID [2022-04-14 14:50:15,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret7 := main(); {24#true} is VALID [2022-04-14 14:50:15,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#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; {24#true} is VALID [2022-04-14 14:50:15,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume false; {25#false} is VALID [2022-04-14 14:50:15,701 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {25#false} is VALID [2022-04-14 14:50:15,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-14 14:50:15,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-14 14:50:15,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-14 14:50:15,702 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-14 14:50:15,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 14:50:15,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:50:15,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179513617] [2022-04-14 14:50:15,702 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:50:15,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264926480] [2022-04-14 14:50:15,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264926480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:50:15,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:50:15,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-14 14:50:15,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267983037] [2022-04-14 14:50:15,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:50:15,708 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-14 14:50:15,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:50:15,711 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-14 14:50:15,721 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-14 14:50:15,721 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-14 14:50:15,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:50:15,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-14 14:50:15,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-14 14:50:15,737 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-14 14:50:15,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:50:15,766 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-14 14:50:15,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-14 14:50:15,766 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-14 14:50:15,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:50:15,767 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-14 14:50:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2022-04-14 14:50:15,773 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-14 14:50:15,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2022-04-14 14:50:15,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 46 transitions. [2022-04-14 14:50:15,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:50:15,830 INFO L225 Difference]: With dead ends: 36 [2022-04-14 14:50:15,830 INFO L226 Difference]: Without dead ends: 16 [2022-04-14 14:50:15,832 INFO L912 BasicCegarLoop]: 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-14 14:50:15,837 INFO L913 BasicCegarLoop]: 22 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, 22 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-14 14:50:15,838 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 14:50:15,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-14 14:50:15,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-14 14:50:15,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:50:15,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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-14 14:50:15,882 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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-14 14:50:15,882 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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-14 14:50:15,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:50:15,888 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-14 14:50:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-14 14:50:15,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:50:15,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:50:15,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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 16 states. [2022-04-14 14:50:15,889 INFO L87 Difference]: Start difference. First operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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 16 states. [2022-04-14 14:50:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:50:15,891 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-14 14:50:15,891 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-14 14:50:15,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:50:15,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:50:15,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:50:15,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:50:15,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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-14 14:50:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-14 14:50:15,895 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-14 14:50:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:50:15,896 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-14 14:50:15,896 INFO L479 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-14 14:50:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-14 14:50:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 14:50:15,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:50:15,897 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:50:15,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 14:50:16,113 WARN L460 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-14 14:50:16,114 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:50:16,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:50:16,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1467496459, now seen corresponding path program 1 times [2022-04-14 14:50:16,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:50:16,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746326541] [2022-04-14 14:50:16,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:50:16,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:50:16,135 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:50:16,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [35411048] [2022-04-14 14:50:16,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:50:16,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:50:16,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:50:16,143 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-14 14:50:16,146 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-14 14:50:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:50:16,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 14:50:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:50:16,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:50:16,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {162#true} call ULTIMATE.init(); {162#true} is VALID [2022-04-14 14:50:16,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#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); {162#true} is VALID [2022-04-14 14:50:16,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {162#true} assume true; {162#true} is VALID [2022-04-14 14:50:16,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162#true} {162#true} #53#return; {162#true} is VALID [2022-04-14 14:50:16,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {162#true} call #t~ret7 := main(); {162#true} is VALID [2022-04-14 14:50:16,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {162#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; {182#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-14 14:50:16,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {182#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {182#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-14 14:50:16,369 INFO L272 TraceCheckUtils]: 7: Hoare triple {182#(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)); {189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:50:16,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:50:16,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {163#false} is VALID [2022-04-14 14:50:16,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {163#false} assume !false; {163#false} is VALID [2022-04-14 14:50:16,370 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-14 14:50:16,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 14:50:16,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:50:16,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746326541] [2022-04-14 14:50:16,371 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:50:16,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35411048] [2022-04-14 14:50:16,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35411048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:50:16,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:50:16,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 14:50:16,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841085281] [2022-04-14 14:50:16,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:50:16,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-14 14:50:16,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:50:16,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-14 14:50:16,382 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-14 14:50:16,382 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 14:50:16,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:50:16,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 14:50:16,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 14:50:16,383 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-14 14:50:16,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:50:16,461 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-14 14:50:16,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 14:50:16,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-14 14:50:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:50:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-14 14:50:16,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-14 14:50:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-14 14:50:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-14 14:50:16,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-14 14:50:16,487 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-14 14:50:16,489 INFO L225 Difference]: With dead ends: 26 [2022-04-14 14:50:16,489 INFO L226 Difference]: Without dead ends: 23 [2022-04-14 14:50:16,489 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-14 14:50:16,490 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 49 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-14 14:50:16,491 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 49 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 14:50:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-14 14:50:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-14 14:50:16,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:50:16,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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-14 14:50:16,495 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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-14 14:50:16,495 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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-14 14:50:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:50:16,497 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-14 14:50:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-14 14:50:16,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:50:16,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:50:16,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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 23 states. [2022-04-14 14:50:16,498 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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 23 states. [2022-04-14 14:50:16,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:50:16,499 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-14 14:50:16,499 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-14 14:50:16,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:50:16,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:50:16,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:50:16,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:50:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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-14 14:50:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-04-14 14:50:16,501 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 11 [2022-04-14 14:50:16,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:50:16,502 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-04-14 14:50:16,502 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-14 14:50:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-14 14:50:16,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-14 14:50:16,502 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:50:16,503 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:50:16,521 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-14 14:50:16,719 WARN L460 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-14 14:50:16,719 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:50:16,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:50:16,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1366100723, now seen corresponding path program 1 times [2022-04-14 14:50:16,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:50:16,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544206583] [2022-04-14 14:50:16,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:50:16,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:50:16,731 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:50:16,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396198719] [2022-04-14 14:50:16,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:50:16,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:50:16,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:50:16,733 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-14 14:50:16,734 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-14 14:50:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:50:16,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-14 14:50:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:50:16,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:50:16,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {319#true} call ULTIMATE.init(); {319#true} is VALID [2022-04-14 14:50:16,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {319#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); {319#true} is VALID [2022-04-14 14:50:16,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {319#true} assume true; {319#true} is VALID [2022-04-14 14:50:16,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {319#true} {319#true} #53#return; {319#true} is VALID [2022-04-14 14:50:16,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {319#true} call #t~ret7 := main(); {319#true} is VALID [2022-04-14 14:50:16,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {319#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; {339#(and (= main_~y~0 1) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 14:50:16,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {339#(and (= main_~y~0 1) (= main_~a~0 main_~x~0))} assume !false; {339#(and (= main_~y~0 1) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 14:50:16,960 INFO L272 TraceCheckUtils]: 7: Hoare triple {339#(and (= main_~y~0 1) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {319#true} is VALID [2022-04-14 14:50:16,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {319#true} ~cond := #in~cond; {349#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:50:16,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {349#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {353#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:50:16,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {353#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {353#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:50:16,962 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {353#(not (= |__VERIFIER_assert_#in~cond| 0))} {339#(and (= main_~y~0 1) (= main_~a~0 main_~x~0))} #49#return; {360#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)))} is VALID [2022-04-14 14:50:16,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {360#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (+ (* main_~y~0 main_~az~0) main_~x~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; {364#(and (= (+ (* main_~a~0 main_~z~0) main_~a~0) (+ main_~a~0 main_~az~0)) (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)))} is VALID [2022-04-14 14:50:16,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {364#(and (= (+ (* main_~a~0 main_~z~0) main_~a~0) (+ main_~a~0 main_~az~0)) (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)))} assume !false; {364#(and (= (+ (* main_~a~0 main_~z~0) main_~a~0) (+ main_~a~0 main_~az~0)) (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)))} is VALID [2022-04-14 14:50:16,969 INFO L272 TraceCheckUtils]: 14: Hoare triple {364#(and (= (+ (* main_~a~0 main_~z~0) main_~a~0) (+ main_~a~0 main_~az~0)) (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~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)); {371#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:50:16,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {371#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {375#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:50:16,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {375#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {320#false} is VALID [2022-04-14 14:50:16,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {320#false} assume !false; {320#false} is VALID [2022-04-14 14:50:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:50:16,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:50:37,728 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-14 14:51:22,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {320#false} assume !false; {320#false} is VALID [2022-04-14 14:51:22,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {375#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {320#false} is VALID [2022-04-14 14:51:22,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {371#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {375#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:51:22,623 INFO L272 TraceCheckUtils]: 14: Hoare triple {391#(= (+ (* 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)); {371#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:51:22,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !false; {391#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-14 14:51:22,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {398#(= (+ (* 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; {391#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-14 14:51:22,718 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {353#(not (= |__VERIFIER_assert_#in~cond| 0))} {319#true} #49#return; {398#(= (+ (* 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-14 14:51:22,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {353#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {353#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:51:22,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {411#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {353#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:51:22,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {319#true} ~cond := #in~cond; {411#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:51:22,719 INFO L272 TraceCheckUtils]: 7: Hoare triple {319#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {319#true} is VALID [2022-04-14 14:51:22,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {319#true} assume !false; {319#true} is VALID [2022-04-14 14:51:22,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {319#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; {319#true} is VALID [2022-04-14 14:51:22,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {319#true} call #t~ret7 := main(); {319#true} is VALID [2022-04-14 14:51:22,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {319#true} {319#true} #53#return; {319#true} is VALID [2022-04-14 14:51:22,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {319#true} assume true; {319#true} is VALID [2022-04-14 14:51:22,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {319#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); {319#true} is VALID [2022-04-14 14:51:22,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {319#true} call ULTIMATE.init(); {319#true} is VALID [2022-04-14 14:51:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:51:22,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:51:22,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544206583] [2022-04-14 14:51:22,720 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:51:22,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396198719] [2022-04-14 14:51:22,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396198719] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 14:51:22,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:51:22,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-14 14:51:22,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650562217] [2022-04-14 14:51:22,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 14:51:22,721 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 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 18 [2022-04-14 14:51:22,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:51:22,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 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-14 14:51:22,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:51:22,793 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-14 14:51:22,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:51:22,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-14 14:51:22,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-14 14:51:22,794 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 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-14 14:51:24,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:51:24,042 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-14 14:51:24,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 14:51:24,043 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 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 18 [2022-04-14 14:51:24,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:51:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 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-14 14:51:24,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-14 14:51:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 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-14 14:51:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-14 14:51:24,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-04-14 14:51:24,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:51:24,381 INFO L225 Difference]: With dead ends: 27 [2022-04-14 14:51:24,381 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 14:51:24,381 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-14 14:51:24,382 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-14 14:51:24,382 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 58 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-14 14:51:24,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 14:51:24,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 14:51:24,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:51:24,383 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-14 14:51:24,383 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-14 14:51:24,383 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-14 14:51:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:51:24,383 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 14:51:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 14:51:24,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:51:24,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:51:24,384 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-14 14:51:24,384 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-14 14:51:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:51:24,384 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 14:51:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 14:51:24,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:51:24,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:51:24,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:51:24,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:51:24,384 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-14 14:51:24,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 14:51:24,384 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-04-14 14:51:24,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:51:24,385 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 14:51:24,385 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 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-14 14:51:24,385 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 14:51:24,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:51:24,387 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 14:51:24,404 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-14 14:51:24,595 WARN L460 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-14 14:51:24,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-14 14:51:24,711 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-14 14:51:24,712 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-14 14:51:24,712 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-14 14:51:24,712 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed. [2022-04-14 14:51:24,712 INFO L882 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-14 14:51:24,712 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-14 14:51:24,712 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-14 14:51:24,712 INFO L882 garLoopResultBuilder]: For program point L34-1(lines 33 42) no Hoare annotation was computed. [2022-04-14 14:51:24,712 INFO L878 garLoopResultBuilder]: At program point L33-2(lines 33 42) the Hoare annotation is: (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) [2022-04-14 14:51:24,713 INFO L878 garLoopResultBuilder]: At program point L33-3(lines 33 42) the Hoare annotation is: (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) [2022-04-14 14:51:24,713 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 21 45) the Hoare annotation is: true [2022-04-14 14:51:24,713 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 21 45) no Hoare annotation was computed. [2022-04-14 14:51:24,713 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 21 45) no Hoare annotation was computed. [2022-04-14 14:51:24,713 INFO L882 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-04-14 14:51:24,713 INFO L878 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) [2022-04-14 14:51:24,713 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-14 14:51:24,713 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-14 14:51:24,713 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-14 14:51:24,713 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-14 14:51:24,713 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-14 14:51:24,713 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-14 14:51:24,714 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-14 14:51:24,714 INFO L882 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-14 14:51:24,714 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-14 14:51:24,714 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-14 14:51:24,714 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-14 14:51:24,714 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-14 14:51:24,714 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-14 14:51:24,718 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-14 14:51:24,719 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 14:51:24,721 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 14:51:24,722 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 14:51:24,722 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-14 14:51:24,725 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-14 14:51:24,725 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-14 14:51:24,725 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 14:51:24,725 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 14:51:24,725 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 14:51:24,725 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 14:51:24,726 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-14 14:51:24,726 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-14 14:51:24,726 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 14:51:24,726 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 14:51:24,726 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-14 14:51:24,726 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-14 14:51:24,726 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-14 14:51:24,727 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-14 14:51:24,727 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-14 14:51:24,727 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-14 14:51:24,727 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-14 14:51:24,727 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-14 14:51:24,727 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-14 14:51:24,727 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 14:51:24,727 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 14:51:24,727 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 14:51:24,727 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 14:51:24,727 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-14 14:51:24,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 02:51:24 BoogieIcfgContainer [2022-04-14 14:51:24,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 14:51:24,735 INFO L158 Benchmark]: Toolchain (without parser) took 69864.85ms. Allocated memory was 198.2MB in the beginning and 269.5MB in the end (delta: 71.3MB). Free memory was 174.6MB in the beginning and 118.5MB in the end (delta: 56.2MB). Peak memory consumption was 127.5MB. Max. memory is 8.0GB. [2022-04-14 14:51:24,736 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory is still 161.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 14:51:24,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.28ms. Allocated memory is still 198.2MB. Free memory was 174.4MB in the beginning and 173.9MB in the end (delta: 527.4kB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2022-04-14 14:51:24,737 INFO L158 Benchmark]: Boogie Preprocessor took 33.21ms. Allocated memory is still 198.2MB. Free memory was 173.9MB in the beginning and 172.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 14:51:24,737 INFO L158 Benchmark]: RCFGBuilder took 256.98ms. Allocated memory is still 198.2MB. Free memory was 172.2MB in the beginning and 161.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-14 14:51:24,738 INFO L158 Benchmark]: TraceAbstraction took 69335.70ms. Allocated memory was 198.2MB in the beginning and 269.5MB in the end (delta: 71.3MB). Free memory was 160.9MB in the beginning and 118.5MB in the end (delta: 42.5MB). Peak memory consumption was 113.6MB. Max. memory is 8.0GB. [2022-04-14 14:51:24,739 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.10ms. Allocated memory is still 198.2MB. Free memory is still 161.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.28ms. Allocated memory is still 198.2MB. Free memory was 174.4MB in the beginning and 173.9MB in the end (delta: 527.4kB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.21ms. Allocated memory is still 198.2MB. Free memory was 173.9MB in the beginning and 172.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 256.98ms. Allocated memory is still 198.2MB. Free memory was 172.2MB in the beginning and 161.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 69335.70ms. Allocated memory was 198.2MB in the beginning and 269.5MB in the end (delta: 71.3MB). Free memory was 160.9MB in the beginning and 118.5MB in the end (delta: 42.5MB). Peak memory consumption was 113.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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.2s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 49 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 15 PreInvPairs, 24 NumberOfFragments, 38 HoareAnnotationTreeSize, 15 FomulaSimplifications, 54 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 67 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 66.2s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 215 SizeOfPredicates, 4 NumberOfNonLiveVariables, 224 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 4/8 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: 33]: Loop Invariant Derived loop invariant: y * az + x == z * x + a RESULT: Ultimate proved your program to be correct! [2022-04-14 14:51:24,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...