/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/mannadiv.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:54:14,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:54:14,829 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:54:14,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:54:14,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:54:14,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:54:14,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:54:14,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:54:14,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:54:14,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:54:14,872 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:54:14,873 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:54:14,873 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:54:14,874 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:54:14,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:54:14,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:54:14,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:54:14,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:54:14,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:54:14,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:54:14,879 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:54:14,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:54:14,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:54:14,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:54:14,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:54:14,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:54:14,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:54:14,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:54:14,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:54:14,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:54:14,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:54:14,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:54:14,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:54:14,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:54:14,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:54:14,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:54:14,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:54:14,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:54:14,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:54:14,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:54:14,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:54:14,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:54:14,912 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:54:14,934 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:54:14,934 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:54:14,934 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:54:14,934 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:54:14,935 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:54:14,935 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:54:14,937 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:54:14,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:54:14,938 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:54:14,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:54:14,939 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:54:14,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:54:14,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:54:14,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:54:14,939 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:54:14,939 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:54:14,939 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:54:14,939 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:54:14,939 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:54:14,939 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:54:14,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:54:14,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:54:14,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:54:14,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:54:14,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:54:14,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:54:14,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:54:14,941 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:54:14,941 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:54:14,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:54:14,942 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:54:14,942 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:54:14,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:54:14,942 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 11:54:15,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:54:15,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:54:15,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:54:15,137 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:54:15,137 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:54:15,138 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/mannadiv.c [2022-04-27 11:54:15,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd44bdb98/490359984a7e46179d4181a6cecec383/FLAG721942ba5 [2022-04-27 11:54:15,553 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:54:15,553 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/mannadiv.c [2022-04-27 11:54:15,558 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd44bdb98/490359984a7e46179d4181a6cecec383/FLAG721942ba5 [2022-04-27 11:54:15,982 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd44bdb98/490359984a7e46179d4181a6cecec383 [2022-04-27 11:54:15,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:54:15,985 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:54:15,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:54:15,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:54:15,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:54:15,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:54:15" (1/1) ... [2022-04-27 11:54:15,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41e05ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:15, skipping insertion in model container [2022-04-27 11:54:15,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:54:15" (1/1) ... [2022-04-27 11:54:15,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:54:16,008 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:54:16,180 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/mannadiv.c[573,586] [2022-04-27 11:54:16,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:54:16,210 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:54:16,225 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/mannadiv.c[573,586] [2022-04-27 11:54:16,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:54:16,252 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:54:16,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:16 WrapperNode [2022-04-27 11:54:16,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:54:16,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:54:16,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:54:16,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:54:16,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:16" (1/1) ... [2022-04-27 11:54:16,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:16" (1/1) ... [2022-04-27 11:54:16,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:16" (1/1) ... [2022-04-27 11:54:16,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:16" (1/1) ... [2022-04-27 11:54:16,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:16" (1/1) ... [2022-04-27 11:54:16,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:16" (1/1) ... [2022-04-27 11:54:16,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:16" (1/1) ... [2022-04-27 11:54:16,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:54:16,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:54:16,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:54:16,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:54:16,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:16" (1/1) ... [2022-04-27 11:54:16,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:54:16,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:54:16,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 11:54:16,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 11:54:16,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:54:16,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:54:16,340 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:54:16,341 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:54:16,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:54:16,341 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:54:16,341 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:54:16,341 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:54:16,341 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:54:16,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:54:16,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:54:16,341 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:54:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:54:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:54:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:54:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:54:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:54:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:54:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:54:16,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:54:16,391 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:54:16,393 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:54:16,542 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:54:16,547 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:54:16,547 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:54:16,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:54:16 BoogieIcfgContainer [2022-04-27 11:54:16,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:54:16,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:54:16,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:54:16,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:54:16,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:54:15" (1/3) ... [2022-04-27 11:54:16,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8a9328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:54:16, skipping insertion in model container [2022-04-27 11:54:16,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:16" (2/3) ... [2022-04-27 11:54:16,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8a9328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:54:16, skipping insertion in model container [2022-04-27 11:54:16,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:54:16" (3/3) ... [2022-04-27 11:54:16,555 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv.c [2022-04-27 11:54:16,564 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:54:16,564 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:54:16,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:54:16,626 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@66ed03aa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b6281ad [2022-04-27 11:54:16,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:54:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:54:16,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:54:16,641 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:54:16,641 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:54:16,642 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:54:16,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:54:16,649 INFO L85 PathProgramCache]: Analyzing trace with hash -786972844, now seen corresponding path program 1 times [2022-04-27 11:54:16,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:54:16,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390505435] [2022-04-27 11:54:16,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:54:16,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:54:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:16,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:54:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:16,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-27 11:54:16,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 11:54:16,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #66#return; {32#true} is VALID [2022-04-27 11:54:16,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:54:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:16,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 11:54:16,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 11:54:16,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 11:54:16,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #58#return; {33#false} is VALID [2022-04-27 11:54:16,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:54:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:16,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 11:54:16,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 11:54:16,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 11:54:16,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #60#return; {33#false} is VALID [2022-04-27 11:54:16,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:54:16,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-27 11:54:16,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 11:54:16,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #66#return; {32#true} is VALID [2022-04-27 11:54:16,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-27 11:54:16,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {32#true} is VALID [2022-04-27 11:54:16,810 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {32#true} is VALID [2022-04-27 11:54:16,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 11:54:16,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 11:54:16,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 11:54:16,811 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #58#return; {33#false} is VALID [2022-04-27 11:54:16,811 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {32#true} is VALID [2022-04-27 11:54:16,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 11:54:16,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 11:54:16,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 11:54:16,813 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #60#return; {33#false} is VALID [2022-04-27 11:54:16,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {33#false} is VALID [2022-04-27 11:54:16,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-27 11:54:16,814 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {33#false} is VALID [2022-04-27 11:54:16,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-27 11:54:16,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-27 11:54:16,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-27 11:54:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:54:16,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:54:16,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390505435] [2022-04-27 11:54:16,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390505435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:54:16,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:54:16,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:54:16,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361197699] [2022-04-27 11:54:16,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:54:16,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 11:54:16,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:54:16,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:54:16,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:54:16,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:54:16,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:54:16,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:54:16,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:54:16,875 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:54:16,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:16,967 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-27 11:54:16,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:54:16,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 11:54:16,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:54:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:54:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-04-27 11:54:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:54:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-04-27 11:54:16,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2022-04-27 11:54:17,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:54:17,076 INFO L225 Difference]: With dead ends: 51 [2022-04-27 11:54:17,076 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 11:54:17,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:54:17,080 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:54:17,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:54:17,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 11:54:17,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-27 11:54:17,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:54:17,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:54:17,104 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:54:17,105 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:54:17,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:17,109 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 11:54:17,109 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 11:54:17,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:54:17,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:54:17,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-27 11:54:17,110 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-27 11:54:17,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:17,116 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 11:54:17,116 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 11:54:17,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:54:17,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:54:17,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:54:17,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:54:17,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:54:17,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-27 11:54:17,121 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-27 11:54:17,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:54:17,121 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-27 11:54:17,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:54:17,122 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-27 11:54:17,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:54:17,122 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:54:17,123 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:54:17,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:54:17,123 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:54:17,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:54:17,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1131020600, now seen corresponding path program 1 times [2022-04-27 11:54:17,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:54:17,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092760578] [2022-04-27 11:54:17,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:54:17,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:54:17,156 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:54:17,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124634288] [2022-04-27 11:54:17,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:54:17,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:54:17,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:54:17,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:54:17,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 11:54:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:17,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:54:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:17,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:54:17,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {199#true} call ULTIMATE.init(); {199#true} is VALID [2022-04-27 11:54:17,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {199#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(11, 2);call #Ultimate.allocInit(12, 3); {199#true} is VALID [2022-04-27 11:54:17,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {199#true} assume true; {199#true} is VALID [2022-04-27 11:54:17,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {199#true} {199#true} #66#return; {199#true} is VALID [2022-04-27 11:54:17,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {199#true} call #t~ret6 := main(); {199#true} is VALID [2022-04-27 11:54:17,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {199#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {199#true} is VALID [2022-04-27 11:54:17,498 INFO L272 TraceCheckUtils]: 6: Hoare triple {199#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {199#true} is VALID [2022-04-27 11:54:17,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#true} ~cond := #in~cond; {199#true} is VALID [2022-04-27 11:54:17,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {199#true} assume !(0 == ~cond); {199#true} is VALID [2022-04-27 11:54:17,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {199#true} assume true; {199#true} is VALID [2022-04-27 11:54:17,499 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {199#true} {199#true} #58#return; {199#true} is VALID [2022-04-27 11:54:17,499 INFO L272 TraceCheckUtils]: 11: Hoare triple {199#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {199#true} is VALID [2022-04-27 11:54:17,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {199#true} ~cond := #in~cond; {240#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:54:17,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {240#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {244#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:54:17,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {244#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {244#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:54:17,505 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {244#(not (= |assume_abort_if_not_#in~cond| 0))} {199#true} #60#return; {251#(not (= main_~x2~0 0))} is VALID [2022-04-27 11:54:17,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {251#(not (= main_~x2~0 0))} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {255#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-27 11:54:17,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {255#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} assume !false; {255#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-27 11:54:17,508 INFO L272 TraceCheckUtils]: 18: Hoare triple {255#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {262#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:54:17,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {266#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:54:17,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {266#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {200#false} is VALID [2022-04-27 11:54:17,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {200#false} assume !false; {200#false} is VALID [2022-04-27 11:54:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:54:17,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:54:17,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:54:17,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092760578] [2022-04-27 11:54:17,510 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:54:17,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124634288] [2022-04-27 11:54:17,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124634288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:54:17,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:54:17,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 11:54:17,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576298504] [2022-04-27 11:54:17,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:54:17,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 11:54:17,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:54:17,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:54:17,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:54:17,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 11:54:17,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:54:17,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 11:54:17,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:54:17,540 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:54:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:17,719 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 11:54:17,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 11:54:17,720 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 11:54:17,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:54:17,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:54:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-27 11:54:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:54:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-27 11:54:17,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-27 11:54:17,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:54:17,758 INFO L225 Difference]: With dead ends: 35 [2022-04-27 11:54:17,759 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 11:54:17,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:54:17,760 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:54:17,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 86 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:54:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 11:54:17,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-04-27 11:54:17,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:54:17,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:54:17,766 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:54:17,766 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:54:17,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:17,768 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-27 11:54:17,768 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-27 11:54:17,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:54:17,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:54:17,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-27 11:54:17,769 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-27 11:54:17,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:17,771 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-27 11:54:17,771 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-27 11:54:17,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:54:17,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:54:17,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:54:17,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:54:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:54:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-27 11:54:17,774 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2022-04-27 11:54:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:54:17,774 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-27 11:54:17,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:54:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-27 11:54:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 11:54:17,775 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:54:17,775 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:54:17,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 11:54:18,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:54:18,013 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:54:18,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:54:18,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1991967029, now seen corresponding path program 1 times [2022-04-27 11:54:18,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:54:18,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407933072] [2022-04-27 11:54:18,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:54:18,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:54:18,035 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:54:18,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1600075232] [2022-04-27 11:54:18,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:54:18,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:54:18,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:54:18,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:54:18,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 11:54:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:18,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 11:54:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:18,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:54:18,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {436#true} call ULTIMATE.init(); {436#true} is VALID [2022-04-27 11:54:18,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {436#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(11, 2);call #Ultimate.allocInit(12, 3); {436#true} is VALID [2022-04-27 11:54:18,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {436#true} assume true; {436#true} is VALID [2022-04-27 11:54:18,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {436#true} {436#true} #66#return; {436#true} is VALID [2022-04-27 11:54:18,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {436#true} call #t~ret6 := main(); {436#true} is VALID [2022-04-27 11:54:18,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {436#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {436#true} is VALID [2022-04-27 11:54:18,275 INFO L272 TraceCheckUtils]: 6: Hoare triple {436#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {436#true} is VALID [2022-04-27 11:54:18,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {436#true} ~cond := #in~cond; {436#true} is VALID [2022-04-27 11:54:18,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {436#true} assume !(0 == ~cond); {436#true} is VALID [2022-04-27 11:54:18,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {436#true} assume true; {436#true} is VALID [2022-04-27 11:54:18,275 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {436#true} {436#true} #58#return; {436#true} is VALID [2022-04-27 11:54:18,275 INFO L272 TraceCheckUtils]: 11: Hoare triple {436#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {436#true} is VALID [2022-04-27 11:54:18,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {436#true} ~cond := #in~cond; {436#true} is VALID [2022-04-27 11:54:18,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {436#true} assume !(0 == ~cond); {436#true} is VALID [2022-04-27 11:54:18,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {436#true} assume true; {436#true} is VALID [2022-04-27 11:54:18,276 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {436#true} {436#true} #60#return; {436#true} is VALID [2022-04-27 11:54:18,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {436#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {436#true} is VALID [2022-04-27 11:54:18,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {436#true} assume !false; {436#true} is VALID [2022-04-27 11:54:18,276 INFO L272 TraceCheckUtils]: 18: Hoare triple {436#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {436#true} is VALID [2022-04-27 11:54:18,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {436#true} ~cond := #in~cond; {498#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:54:18,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {498#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:54:18,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {502#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:54:18,279 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {502#(not (= |__VERIFIER_assert_#in~cond| 0))} {436#true} #62#return; {509#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} is VALID [2022-04-27 11:54:18,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {509#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} assume !(0 != ~y3~0); {513#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-27 11:54:18,280 INFO L272 TraceCheckUtils]: 24: Hoare triple {513#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {517#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:54:18,281 INFO L290 TraceCheckUtils]: 25: Hoare triple {517#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {521#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:54:18,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {521#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {437#false} is VALID [2022-04-27 11:54:18,281 INFO L290 TraceCheckUtils]: 27: Hoare triple {437#false} assume !false; {437#false} is VALID [2022-04-27 11:54:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:54:18,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:54:26,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {437#false} assume !false; {437#false} is VALID [2022-04-27 11:54:26,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {521#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {437#false} is VALID [2022-04-27 11:54:26,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {517#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {521#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:54:26,663 INFO L272 TraceCheckUtils]: 24: Hoare triple {513#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {517#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:54:26,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {540#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} assume !(0 != ~y3~0); {513#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-27 11:54:26,664 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {502#(not (= |__VERIFIER_assert_#in~cond| 0))} {436#true} #62#return; {540#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} is VALID [2022-04-27 11:54:26,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {502#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:54:26,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {553#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:54:26,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {436#true} ~cond := #in~cond; {553#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:54:26,666 INFO L272 TraceCheckUtils]: 18: Hoare triple {436#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {436#true} is VALID [2022-04-27 11:54:26,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {436#true} assume !false; {436#true} is VALID [2022-04-27 11:54:26,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {436#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {436#true} is VALID [2022-04-27 11:54:26,666 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {436#true} {436#true} #60#return; {436#true} is VALID [2022-04-27 11:54:26,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {436#true} assume true; {436#true} is VALID [2022-04-27 11:54:26,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {436#true} assume !(0 == ~cond); {436#true} is VALID [2022-04-27 11:54:26,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {436#true} ~cond := #in~cond; {436#true} is VALID [2022-04-27 11:54:26,667 INFO L272 TraceCheckUtils]: 11: Hoare triple {436#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {436#true} is VALID [2022-04-27 11:54:26,667 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {436#true} {436#true} #58#return; {436#true} is VALID [2022-04-27 11:54:26,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {436#true} assume true; {436#true} is VALID [2022-04-27 11:54:26,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {436#true} assume !(0 == ~cond); {436#true} is VALID [2022-04-27 11:54:26,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {436#true} ~cond := #in~cond; {436#true} is VALID [2022-04-27 11:54:26,667 INFO L272 TraceCheckUtils]: 6: Hoare triple {436#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {436#true} is VALID [2022-04-27 11:54:26,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {436#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {436#true} is VALID [2022-04-27 11:54:26,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {436#true} call #t~ret6 := main(); {436#true} is VALID [2022-04-27 11:54:26,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {436#true} {436#true} #66#return; {436#true} is VALID [2022-04-27 11:54:26,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {436#true} assume true; {436#true} is VALID [2022-04-27 11:54:26,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {436#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(11, 2);call #Ultimate.allocInit(12, 3); {436#true} is VALID [2022-04-27 11:54:26,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {436#true} call ULTIMATE.init(); {436#true} is VALID [2022-04-27 11:54:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:54:26,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:54:26,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407933072] [2022-04-27 11:54:26,669 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:54:26,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600075232] [2022-04-27 11:54:26,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600075232] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:54:26,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:54:26,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 11:54:26,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403399540] [2022-04-27 11:54:26,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:54:26,670 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 28 [2022-04-27 11:54:26,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:54:26,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 11:54:26,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:54:26,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:54:26,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:54:26,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:54:26,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:54:26,693 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 11:54:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:26,886 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-27 11:54:26,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:54:26,887 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 28 [2022-04-27 11:54:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:54:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 11:54:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-27 11:54:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 11:54:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-27 11:54:26,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-04-27 11:54:26,917 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-27 11:54:26,917 INFO L225 Difference]: With dead ends: 30 [2022-04-27 11:54:26,918 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:54:26,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:54:26,922 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:54:26,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 71 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:54:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:54:26,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:54:26,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:54:26,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:54:26,924 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:54:26,924 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:54:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:26,925 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:54:26,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:54:26,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:54:26,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:54:26,928 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:54:26,928 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:54:26,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:26,930 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:54:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:54:26,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:54:26,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:54:26,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:54:26,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:54:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:54:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:54:26,931 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-27 11:54:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:54:26,931 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:54:26,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 11:54:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:54:26,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:54:26,934 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:54:26,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 11:54:27,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 11:54:27,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:54:27,212 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 9) no Hoare annotation was computed. [2022-04-27 11:54:27,212 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 9) no Hoare annotation was computed. [2022-04-27 11:54:27,212 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 9) no Hoare annotation was computed. [2022-04-27 11:54:27,212 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 12 14) the Hoare annotation is: true [2022-04-27 11:54:27,212 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-04-27 11:54:27,212 INFO L899 garLoopResultBuilder]: For program point L13-2(lines 12 14) no Hoare annotation was computed. [2022-04-27 11:54:27,212 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 12 14) no Hoare annotation was computed. [2022-04-27 11:54:27,213 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 48) the Hoare annotation is: (let ((.cse0 (* main_~x2~0 main_~y1~0))) (and (not (= main_~x2~0 0)) (= (+ .cse0 main_~y3~0 main_~y2~0) main_~x1~0) (= (+ .cse0 main_~y2~0) main_~x1~0))) [2022-04-27 11:54:27,213 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-04-27 11:54:27,213 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 22 51) no Hoare annotation was computed. [2022-04-27 11:54:27,213 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 22 51) no Hoare annotation was computed. [2022-04-27 11:54:27,213 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 47) no Hoare annotation was computed. [2022-04-27 11:54:27,213 INFO L895 garLoopResultBuilder]: At program point L40-2(lines 35 48) the Hoare annotation is: (and (not (= main_~x2~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)) [2022-04-27 11:54:27,213 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (not (= main_~x2~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)) [2022-04-27 11:54:27,213 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 35 48) no Hoare annotation was computed. [2022-04-27 11:54:27,213 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 51) the Hoare annotation is: true [2022-04-27 11:54:27,213 INFO L902 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-27 11:54:27,213 INFO L902 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: true [2022-04-27 11:54:27,214 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-04-27 11:54:27,214 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:54:27,214 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 11:54:27,214 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:54:27,214 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:54:27,214 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:54:27,214 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:54:27,214 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:54:27,214 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 18) no Hoare annotation was computed. [2022-04-27 11:54:27,214 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 19) no Hoare annotation was computed. [2022-04-27 11:54:27,214 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 21) the Hoare annotation is: true [2022-04-27 11:54:27,214 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 21) no Hoare annotation was computed. [2022-04-27 11:54:27,215 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 21) no Hoare annotation was computed. [2022-04-27 11:54:27,215 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) no Hoare annotation was computed. [2022-04-27 11:54:27,217 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 11:54:27,218 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:54:27,221 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:54:27,221 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:54:27,222 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 11:54:27,222 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:54:27,222 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 11:54:27,222 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:54:27,222 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:54:27,222 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 11:54:27,222 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 11:54:27,223 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:54:27,223 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:54:27,223 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:54:27,223 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:54:27,223 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 11:54:27,223 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 11:54:27,223 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 11:54:27,223 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 11:54:27,223 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 11:54:27,223 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 11:54:27,223 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 11:54:27,223 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 11:54:27,223 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:54:27,223 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:54:27,225 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 11:54:27,225 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 11:54:27,225 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 11:54:27,225 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 11:54:27,226 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 11:54:27,226 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 11:54:27,226 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 11:54:27,226 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:54:27,226 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:54:27,226 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 11:54:27,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:54:27 BoogieIcfgContainer [2022-04-27 11:54:27,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:54:27,232 INFO L158 Benchmark]: Toolchain (without parser) took 11247.67ms. Allocated memory was 205.5MB in the beginning and 249.6MB in the end (delta: 44.0MB). Free memory was 155.4MB in the beginning and 110.2MB in the end (delta: 45.2MB). Peak memory consumption was 89.3MB. Max. memory is 8.0GB. [2022-04-27 11:54:27,233 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 205.5MB. Free memory is still 171.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:54:27,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.01ms. Allocated memory is still 205.5MB. Free memory was 155.1MB in the beginning and 180.6MB in the end (delta: -25.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 11:54:27,233 INFO L158 Benchmark]: Boogie Preprocessor took 33.58ms. Allocated memory is still 205.5MB. Free memory was 180.6MB in the beginning and 179.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 11:54:27,233 INFO L158 Benchmark]: RCFGBuilder took 261.61ms. Allocated memory is still 205.5MB. Free memory was 179.2MB in the beginning and 168.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 11:54:27,234 INFO L158 Benchmark]: TraceAbstraction took 10681.83ms. Allocated memory was 205.5MB in the beginning and 249.6MB in the end (delta: 44.0MB). Free memory was 168.1MB in the beginning and 110.2MB in the end (delta: 57.8MB). Peak memory consumption was 102.3MB. Max. memory is 8.0GB. [2022-04-27 11:54:27,235 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.11ms. Allocated memory is still 205.5MB. Free memory is still 171.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.01ms. Allocated memory is still 205.5MB. Free memory was 155.1MB in the beginning and 180.6MB in the end (delta: -25.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.58ms. Allocated memory is still 205.5MB. Free memory was 180.6MB in the beginning and 179.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 261.61ms. Allocated memory is still 205.5MB. Free memory was 179.2MB in the beginning and 168.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 10681.83ms. Allocated memory was 205.5MB in the beginning and 249.6MB in the end (delta: 44.0MB). Free memory was 168.1MB in the beginning and 110.2MB in the end (delta: 57.8MB). Peak memory consumption was 102.3MB. 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: 18]: 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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 121 IncrementalHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 64 mSDtfsCounter, 121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 17 PreInvPairs, 23 NumberOfFragments, 60 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 61 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 202 SizeOfPredicates, 10 NumberOfNonLiveVariables, 173 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 18/20 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: 35]: Loop Invariant Derived loop invariant: !(x2 == 0) && x2 * y1 + y3 + y2 == x1 RESULT: Ultimate proved your program to be correct! [2022-04-27 11:54:27,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...